{"id":"51025d38-666b-4521-a3bb-3370023b6787","arxiv_id":"1908.01831","paper_version":1,"verdict":"UNVERDICTED","confidence":"HIGH","novelty_score":2.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"An expository note proving that f(t)=t^{p^m}+c has no preperiodic points over any finite field F_{p^n}.","lead":"This note is an easy-to-read introduction to arithmetic dynamics, the study of repeated iteration of polynomial maps over finite fields. It is written for undergraduates with basic proof skills and includes a simple theorem about when a polynomial has no preperiodic orbits.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1's proof contains a false exponent identity in its induction step, so the written proof of injectivity is invalid; the theorem itself remains true and repairable via Proposition 1.","rationale":"The reader's verdict identified the Frobenius injectivity as the weakest assumption, which is standard and sound. The sharper issue for the central claim is the invalid induction step in the proof of Theorem 1: the false exponent identity prevents the written argument from closing. However, the theorem is correct and can be proven directly from Proposition 1, so the flaw is a repairable proof gap rather than a mathematical falsehood. The appendix contains a separate serious error in the existence proof for finite fields, but that is not load-bearing for Theorem 1 once finite fields are taken as given. Since the reader already returned UNVERDICTED and this analysis reinforces that assessment, no change to the verdict is needed.","tokens_in":6523,"tokens_out":7188,"duration_ms":71821,"concrete_test":"Re-derive the induction step in Section 3 using the correct exponent law (a^{p^N})^p = a^{p^{N+1}} in place of the displayed a^p a^{p^N}. If the corrected step closes using Proposition 1 and yields a=b for all m, the concern reduces to a repairable proof error; if the corrected induction still fails, replace the proof with the two-line composition argument f = T_c ∘ φ^m and present that as the proof of Theorem 1.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central proof of Theorem 1 in Section 3 attempts to show that f(t)=t^{p^m}+c is injective by induction on m. The induction step asserts that a^{p^{N+1}}=a^p a^{p^N} and similarly b^{p^{N+1}}=b^p b^{N+1}. This exponent identity is false: the correct law is a^{p^{N+1}}=(a^{p^N})^p. Consequently, the sentence 'Applying the inductive hypothesis, to a^{p^N} and b^{p^N}, we conclude a^p=b^p' is not a valid deduction. The induction hypothesis has the form 'if x^{p^N}=y^{p^N}, then x=y'; from a^{p^{N+1}}=b^{p^{N+1}} one may only infer (a^{p^N})^p=(b^{p^N})^p. The intended repair is to apply the already-proved injectivity of Frobenius (Proposition 1) to obtain a^{p^N}=b^{p^N}, and then apply the induction hypothesis. Since f is the composition of the Frobenius automorphism with a translation, the theorem is nevertheless true and a correct proof is immediate. The concern is therefore a genuine gap in the written proof, not a counterexample to the stated result.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":6769,"tokens_out":7183,"duration_ms":73914,"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":[{"comment":"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.","section":"Section 3, Theorem 1 proof"},{"comment":"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.","section":"Appendix, Theorem 2 (Existence)"},{"comment":"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.","section":"Appendix, Theorem 3"}],"minor_comments":[{"comment":"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":"Section 2, Lemma 1"},{"comment":"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":"Section 3, Theorem 1 proof"},{"comment":"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.","section":"Section 4, Proposition 2"},{"comment":"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.","section":"Appendix, Uniqueness sketch"}],"recommendation":"major_revision","confidential_remarks":"The central theorem is correct and the false exponent identity in Section 3 looks like a repairable typo, but the appendix is not a mere typo and needs a substantive rewrite. The paper is otherwise appropriate for an expository venue; I see no novelty-disclosure, citation-pattern, or scope concerns beyond the mathematical corrections described in the report."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This is an expository note, not a research paper. The main theorem, that f(t)=t^{p^m}+c has no preperiodic points over F_{p^n}, is true, but the written proof has a real gap and the appendix contains a serious error.\n\nWhat the paper does well: the examples are clear and pedagogically useful—the friend graph, the F8 and F9 constructions, and the directed graph pictures give a student a concrete feel for orbit types. The dynamical proof of Fermat's Little Theorem is a nice touch. The main result is a good classroom fact: because the Frobenius map is an automorphism of a finite field, the m-fold iterate is injective and hence every point is periodic.\n\nThe soft spots are real. In Theorem 1, the induction step asserts a^{p^{N+1}}=a^p a^{p^N}, which is false; the correct identity is a^{p^{N+1}}=(a^{p^N})^p. The proof can be repaired by applying Proposition 1 (injectivity of Frobenius) to get a^{p^N}=b^{p^N} and then the induction hypothesis, so the theorem stands, but the argument as written is invalid. More seriously, the appendix's existence proof is wrong: Z[x] is not a PID, and even if the ideal generated by an irreducible polynomial were maximal, Z[x]/(p(x)) would not be a field with p^n elements. The correct construction works over F_p[x] with a monic irreducible of degree n. This is not a minor typo; it is the central claim of the appendix.\n\nThere is also a small omission: the paper never explains why injectivity of a self-map on a finite set implies no preperiodic points. It is true (injectivity gives bijectivity, so every point is periodic), but an undergraduate reader would need that spelled out.\n\nWho is this for? An undergraduate who has taken a proofs course and some linear algebra. It could serve as supplementary reading in a first course on finite fields or arithmetic dynamics. It is not a research contribution and should not be judged as one. The reader's take is accurate: low significance, low novelty, and the errors are genuine.\n\nRecommendation: desk reject for a research journal. For an expository or education-focused venue, it would deserve a serious referee after the authors fix the induction gap and rewrite the appendix proof. I would not cite it in my own research, but I could imagine assigning it to an undergraduate reading group once corrected.","headline":"An expository undergraduate note with a true core result but a flawed proof and an invalid appendix proof of existence of finite fields.","tokens_in":7266,"tokens_out":3424,"would_cite":false,"duration_ms":36820,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37P05","11T06","11T30"],"pacs":[],"model":"deepseek-v4-flash","headline":"For $f(t)=t^{p^m}+c$ over every finite field, no point is preperiodic: every orbit is a cycle.","keywords":["arithmetic dynamics","finite fields","Frobenius automorphism","preperiodic points","polynomial dynamics","Fermat's little theorem","orbit types","dynamical systems"],"falsifier":"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.","tokens_in":6321,"feed_emoji":"🔁","tokens_out":11799,"duration_ms":113450,"temperature":0.7,"pith_summary":"This expository paper introduces arithmetic dynamics—the study of patterns produced by iterating polynomial maps over finite fields. Its main theorem is that for any prime $p$, any natural number $m$, and any constant $c\\in\\mathbb{F}_p$, the map $f(t)=t^{p^m}+c$ has no preperiodic points on any finite field $\\mathbb{F}_{p^n}$: every starting value lies on a periodic cycle. The key step is showing $f$ is injective, using the Frobenius map $a\\mapsto a^p$, which is an automorphism of every finite field. The paper also gives a dynamical proof of Fermat's Little Theorem by counting period-$p$ points of a map on the unit interval, and it closes with open questions linking preperiodic points to Hasse's theorem, zeta functions, and Galois groups. If the main theorem is correct, it supplies an infinite family of finite-field dynamical systems whose orbit structure is completely understood.","feed_headline":"Every orbit of t^{p^m}+c on finite fields is a pure cycle","feed_subtitle":"Because the Frobenius map is one-to-one, every orbit is a cycle; nothing merely falls into one.","key_machinery":"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.","core_discovery":"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$.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Supplies the existence and uniqueness of finite fields and the background field theory behind the Frobenius automorphism used in Theorem 1.","marker":"[3]"},{"why":"Gives the Iga dynamical proof of Fermat's Little Theorem that Section 4 presents via counting period-p points.","marker":"[5]"},{"why":"Offers the companion polynomial-dynamics proof of Fermat's Little Theorem, cited alongside the Iga argument.","marker":"[2]"}],"fun_headline_variants":["No preperiodic points: iterating t^{p^m}+c on finite fields always cycles","Frobenius injectivity forces every orbit of t^{p^m}+c to be a pure cycle","Arithmetic dynamics: a dynamical proof of Fermat's Little Theorem","Every orbit of t^{p^m}+c over finite fields is periodic—nothing preperiodic","The Frobenius map forces cycles and proves Fermat's little theorem"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["No preperiodic points: iterating t^{p^m}+c on finite fields always cycles","Frobenius injectivity forces every orbit of t^{p^m}+c to be a pure cycle","Arithmetic dynamics: a dynamical proof of Fermat's Little Theorem","Every orbit of t^{p^m}+c over finite fields is periodic—nothing preperiodic","The Frobenius map forces cycles and proves Fermat's little theorem"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000748,"raw_usage":{"total_tokens":3277,"prompt_tokens":832,"completion_tokens":2445,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":448,"completion_tokens_details":{"reasoning_tokens":2330}},"tokens_in":448,"tokens_out":2445,"duration_ms":16861,"temperature":1.0,"reasoning_tokens":2330,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:01:13.301151+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"Abstract algebra, Third edition","cited_arxiv_id":null,"evidence_quote":"Supplies the existence and uniqueness of finite fields and the background field theory behind the Frobenius automorphism used in Theorem 1."},{"cited_title":"A Dynamical Systems Proof of Fermat’s Little Theorem","cited_arxiv_id":null,"evidence_quote":"Gives the Iga dynamical proof of Fermat's Little Theorem that Section 4 presents via counting period-p points."},{"cited_title":"Polynomial dynamics and a proof of the Fermat little theorem","cited_arxiv_id":null,"evidence_quote":"Offers the companion polynomial-dynamics proof of Fermat's Little Theorem, cited alongside the Iga argument."}],"review_version":1}