{"id":"05584061-6335-468b-aef0-b3101dc507db","arxiv_id":"1908.01805","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The Frobenius index of a Drinfeld module is characterized by maximal monic polynomials evaluated at Frobenius, yielding an efficient algorithm for the endomorphism ring and an explicit Frobenius matrix.","lead":"The paper gives an algorithm to compute the full endomorphism ring of a Drinfeld module over a finite field, plus an explicit matrix for the Frobenius action, assuming the endomorphism algebra is commutative. This matrix reduces modulo torsion levels to describe how primes split in division fields, giving a concrete reciprocity tool.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Theorem 3.1 and the Section 3 algorithm are sound under the explicit assumption (1.1), and Section 4's freeness condition is honestly flagged with a concrete counterexample.","rationale":"The reader's verdict of ACCEPT is consistent with my reading. The reader's weakest_assumption identifies the commutativity assumption (1.1) and the freeness of Tl(phi) in Section 4; these are genuine restrictions, but the paper states them explicitly and never claims to remove them. I treated the possibility that (1.1) is silently violated, that the algorithm's search might accept a false Frobenius index, and that the matrix F(p) in Example 4.10 might be inconsistent with the general formula. In each case the paper's argument either supplies a justification or the apparent inconsistency dissolves once the non-uniqueness of the basis in Theorem 2.1 is taken into account. The only mild limitation I see is that Step 1 of the algorithm, for r >= 3 and [k : F_p] > 1, does not give a fully self-contained method for computing the minimal polynomial P(x); however, the paper does not claim to provide this subroutine for all cases, and this does not undermine the correctness of Theorem 3.1 or the algorithm once P(x) is available. I therefore see no change to the reader's verdict.","tokens_in":16466,"tokens_out":29853,"duration_ms":289694,"concrete_test":"Recompute Example 3.3 from scratch with an independent implementation of the Section 3 algorithm (compute P(x), chi(B/A[pi]), enumerate candidate Frobenius indices, and run the right-division and commutation checks) and confirm the Frobenius index (T+4, (T+4)^2) and the endomorphism basis e1, e2, e3. Also verify the non-freeness claim in Example 4.10 by directly checking that no vector v in F5^3 satisfies det[v, e2 v, e3 v] != 0 over F5. If both checks pass, the paper's computational claims and its conditional treatment of Theorem 4.5 stand.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim, Theorem 3.1, is adequately supported. The proof of Theorem 2.1 supplies an A-basis of E of the form 1, f1(pi)/b1, ..., fr-1(pi)/br-1, and the finite-search Step 2 of Section 3 correctly uses the maximality property to recognize the actual Frobenius index: any candidate (c_i) that passes the condition fi(pi) in c_i E must satisfy c_i divides b_i, so the candidate with the largest index product is the true one. I checked two delicate points that might have been glossed over. First, in the maximality half of Theorem 3.1, the omission of basis elements of degree greater than i is justified by descending induction on the highest degree: the top-degree coefficient forces the coefficient of fr-1(pi)/br-1 to vanish, then recursively the next coefficients vanish, leaving only degrees up to i. Second, the apparent coefficient mismatch between formula (4.2) and the matrix F(p) printed in Example 4.10 is explained by the freedom to choose f1(x)=x rather than f1(x)=x+4 when b1=1; with a10=0, a21=3, and a20=1, the printed matrix is exactly what (4.2) gives. Section 4's Theorem 4.5 is explicitly conditional on freeness of the Tate modules, and Example 4.10 shows that this hypothesis can genuinely fail, which the authors disclose rather than hide. Thus I do not find a load-bearing flaw; the restrictions (1.1) and the freeness of Tl(phi) are real limitations but not hidden assumptions.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies endomorphism rings E of Drinfeld F_q[T]-modules over finite fields under the standing assumption (1.1), namely that the field K generated by the Frobenius endomorphism π satisfies [K:F]=r. Under this assumption E is an A-order in K and the quotient E/A[π] has invariant factors b_1,...,b_{r-1}, called the Frobenius index. The central result, Theorem 3.1, characterizes these invariant factors by the existence of monic polynomials f_i(x) of degree i with f_i(π)∈b_i E, together with a maximality property saying that any monic g of degree i with g(π)∈bE forces b to divide b_i. This is derived from an order-basis theorem, Theorem 2.1, proved in Section 2. The authors then give a finite-search algorithm for computing the Frobenius index and an explicit A-basis of E, and they report a Magma implementation with rank-2 and rank-3 examples. In Section 4 they show that, under a freeness hypothesis on the Tate module T_l(φ) over E_l, the matrix F(p) obtained from the action of π on E represents the Frobenius conjugacy class in the Galois group of division fields. They also give an example where T_l(φ) is not free over E_l, honestly flagging the failure of the hypothesis.","tokens_in":16837,"tokens_out":11962,"duration_ms":122900,"significance":"If the results hold, this is a substantial contribution to the algorithmic and arithmetic theory of Drinfeld modules. The proof of Theorem 2.1 is self-contained and supplies an explicit A-basis of E; the maximality argument in Theorem 3.1 is sound and correctly justifies the finite search in Section 3. The paper is also explicit about its main restrictions: assumption (1.1) is stated at the outset, and the freeness condition in Theorem 4.5 is isolated and tested with a concrete counterexample. The refinement of the reciprocity law from the authors' earlier work and the explicit Frobenius matrix are valuable, and the discussion of the Gorenstein property for endomorphism rings is a useful addition to the Drinfeld-module literature. The main limitations are the restriction to the commutative case [K:F]=r and the fact that several computational assertions in Examples 3.3, 4.9, and 4.10 are not accompanied by released code or verification data; these limitations do not affect the correctness of the central proofs.","major_comments":[],"minor_comments":[{"comment":"The sentence 'If for some possible choice of f1,...,fr−1 we have fi(π)∈biE, then (b1,...,br−1) is the Frobenius index' is only correct because the candidate list is processed in decreasing order of the degrees of the products ∏bi; this ordering should be stated explicitly as a loop invariant or precondition immediately before that sentence.","section":"§3, Step 2"},{"comment":"The decomposition b=x1y1 and bi=x2y2z with the stated coprimality conditions is quite compressed; an explicit prime-exponent formulation would make the divisibility conclusion b|bi much more transparent for the reader.","section":"§3, proof of Theorem 3.1"},{"comment":"The symbol q is used both for the cardinality of Fq in Section 1.1 and for a prime element of A in the proof of Theorem 3.1, which is confusing; a different letter such as l or 𝔭 should be used for the prime.","section":"§2 and §3, notation"},{"comment":"The algorithm mentions the discriminant-based computation of χ(B/A[π]) under the condition that K/F is separable, but it does not state whether separability follows from assumption (1.1); if it does, a brief justification would be helpful, and if not, the role of the separability condition should be clarified.","section":"§3, Step 1"},{"comment":"The entries involving fractions such as bi/bi−1 are only visibly in A because of the chain b1|b2|...|br−1 from the invariant-factor theory; this divisibility should be recalled explicitly when the matrix Fk is introduced.","section":"§4, equations (4.1)–(4.2)"},{"comment":"The irreducibility of the degree-5 factor g(x), the F5-linear independence of v1,v2,v3, and the matrices for ē2 and ē3 are asserted without a computation transcript; providing the Magma code or a small verification script would make this interesting counterexample reproducible.","section":"Example 4.10"},{"comment":"The observation that the conclusion of Theorem 4.5 holds for n=T+4 even though its hypothesis fails is interesting, but since it concerns a single prime it should be phrased as a remark rather than as evidence that the freeness hypothesis is unnecessary in general.","section":"Example 4.10, final sentence"}],"recommendation":"accept","confidential_remarks":"I found no circularity or load-bearing correctness issue in the manuscript. The self-citation to [10] is used appropriately for context and for Remark 3.2, and the central theorems are supported by detailed proofs. The absence of released Magma code for the computational examples is a minor reproducibility concern but not, in my view, a reason to delay acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core result here is the maximal characterization of all invariant factors b_i of E/A[π], not just b_1 as in the authors' earlier paper. That is real progress, and the proof via the order-basis theorem (Theorem 2.1) is clean. I checked the two delicate spots the stress-test flagged: the descending induction in the maximality half of Theorem 3.1 is justified, and the apparent mismatch between formula (4.2) and the matrix in Example 4.10 is explained by choosing f_1(x)=x. The algorithm in Section 3 is efficient and clearly correct, and the non-Gorenstein example in Section 4 is a genuinely interesting phenomenon, honestly disclosed with a detailed check that the Tate module fails to be free. The paper is also careful to state assumption (1.1) up front and to flag when the Section 4 results depend on freeness of T_l(φ).\n\nThe main weakness is reproducibility. The computational claims in Examples 3.3, 4.9, and 4.10—irreducible factorizations, basis verifications, and the non-Gorenstein check—are asserted without releasing the Magma code. A serious referee should ask for that code or for enough data to rerun the examples independently. This does not undermine the written mathematics; the proofs of the main theorems are detailed and internally consistent. The assumption (1.1) limits the scope, but the authors say so, and the rank-2 case and ordinary modules are exactly the cases where it holds. The comparison with Kuhn–Pink in Remark 3.4 is fair and does not overstate the advantage.\n\nThe paper is for Drinfeld-module specialists and for people using reciprocity laws in function fields. It deserves a serious referee and, assuming the examples check out, publication. I would recommend accepting for review and requesting the code as supplementary material.","headline":"A genuinely useful paper: the theorem is sound under its explicit assumption, the algorithm is a real improvement, and the only significant weakness is the lack of released code for the computational examples.","tokens_in":611,"tokens_out":837,"would_cite":true,"duration_ms":17270,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11G09","11R58"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that the endomorphism ring E of a rank-r Drinfeld module over a finite field, when its endomorphism algebra is commutative, is pinned down by the Frobenius index (the invariant factors of E/A[π]), and gives a finite…","keywords":["Drinfeld modules","endomorphism rings","Frobenius index","A-orders","Gorenstein rings","division fields","reciprocity law","finite fields"],"falsifier":"Take a rank-3 Drinfeld module satisfying (1.1), run the Section 3 search, and compute the invariant factors of $E/A[\\pi]$ independently by Smith normal form from the returned $A$-basis; if they differ from the returned $(b_1,b_2)$, the maximality theorem or the search is wrong. For Example 4.10, test the displayed matrices: if some $v\\in F_5^3$ makes $\\{v, e_2 v, e_3 v\\}$ linearly independent, then $\\varphi[l]$ is free over $E_l/lE_l$ and the paper's non-freeness claim fails.","tokens_in":16291,"feed_emoji":"🧮","tokens_out":13315,"duration_ms":116968,"temperature":0.7,"pith_summary":"This paper is about pinning down the endomorphism ring of a Drinfeld module over a finite field once the ring generated by the Frobenius endomorphism is understood. The authors' claim is that, when the endomorphism algebra is commutative, the difference between the full endomorphism ring $E$ and the Frobenius-generated subring $A[\\pi]$ is encoded exactly by a chain of invariant factors $(b_1,\\ldots,b_{r-1})$—the Frobenius index—and that each $b_i$ is the largest multiplier for which a degree-$i$ polynomial in $\\pi$ can land in $E$. From this they extract an efficient finite-search algorithm that outputs an explicit $A$-basis of $E$ and an explicit matrix for multiplication by $\\pi$, and they show this matrix reduces modulo $n$ to the Frobenius conjugacy class in division fields. The refinement matters because endomorphism rings control isogenies, torsion, and Galois representations, and explicit computation in rank at least 3 was previously much less accessible.","feed_headline":"Frobenius index determines Drinfeld endomorphism rings","feed_subtitle":"A chain of invariant factors measures how far the ring sits above the Frobenius subring, and a finite search computes it.","key_machinery":"The central object is the Frobenius index of $\\varphi$: the tuple $(b_1,\\ldots,b_{r-1})$ of invariant factors of the finite $A$-module $E/A[\\pi]$, normalized so that $b_1 \\mid b_2 \\mid \\cdots \\mid b_{r-1}$. The machinery that carries the argument is the order-basis theorem (Theorem 2.1): if $A[\\pi]\\subset O$ are $A$-orders in a field $K$ of degree $r$ over $F$, then $O$ has an $A$-basis of the form $1, f_1(\\pi)/b_1, \\ldots, f_{r-1}(\\pi)/b_{r-1}$ with $f_i$ monic of degree $i$ and the $b_i$ exactly the invariant factors. This basis converts the abstract inclusion $E/A[\\pi]$ into explicit polynomial witnesses, makes the action of $\\pi$ readable as a matrix $F(p)$, and reduces the computation of $E$ to a finite search for the $b_i$ and $f_i$, pruned by the divisibility constraints $b_i b_j \\mid b_{i+j}$ and $b_1^{r(r-1)} \\mid \\mathrm{disc}(A[\\pi])$.","core_discovery":"Let $A=\\mathbb{F}_q[T]$, let $\\varphi$ be a rank-$r$ Drinfeld module over a finite field $k$, put $E=\\mathrm{End}_k(\\varphi)$, and let $\\pi$ be the Frobenius endomorphism. Assume $[K:F]=r$, where $K=F(\\pi)$, so that $E$ is an $A$-order in the commutative field $K$. The paper's central discovery is Theorem 3.1: if $(b_1,\\ldots,b_{r-1})$ are the invariant factors of the finite module $E/A[\\pi]$, then for each $i$ there is a monic polynomial $f_i(x)\\in A[x]$ of degree $i$ with $f_i(\\pi)\\in b_i E$, and whenever a monic $g$ of degree $i$ satisfies $g(\\pi)\\in bE$, one must have $b\\mid b_i$. Thus the $b_i$ are exactly the maximal multipliers for which degree-$i$ polynomial relations in $\\pi$ survive inside $E$. The proof rests on an order-basis theorem that produces an $A$-basis of $E$ of the shape $1, f_1(\\pi)/b_1, \\ldots, f_{r-1}(\\pi)/b_{r-1}$; this basis makes the action of $\\pi$ explicit and yields the Frobenius matrix $F(p)$. For a reduction of a Drinfeld module $\\Phi$ at a good prime $p$, the paper shows that $F(p)$ reduced modulo $n$ represents the Frobenius at $p$ in $\\mathrm{Gal}(F(\\Phi[n])/F)\\subset \\mathrm{GL}_r(A/nA)$ whenever each Tate module $T_l(\\varphi)$ is free over $E_l$, and it gives a rank-3 example where that freeness fails.","pith_inferences":["Beyond the paper: the order-basis argument should transfer to any $A$-order in a commutative field generated by a single element, so the same finite-search strategy is a plausible template for other endomorphism-ring computations.","Beyond the paper: Example 4.10 suggests the freeness hypothesis in Theorem 4.5 is not necessary in every case; a sharpened theorem might replace it by a milder condition such as $l \\nmid b_1$ or a condition on the index of $E$ in the integral closure.","Beyond the paper: the congruence constraints hidden in $F(p)$ (for instance $a_{10}(a_{21}-a_{10})\\equiv a_{20} \\pmod{b_1}$) give a practical shortcut for detecting extra endomorphisms before computing the full ring.","Beyond the paper: the algorithm opens the way to statistical studies of Frobenius indices for rank 3 and higher—how often $b_1\\neq 1$ or $E$ is non-maximal—which the paper's examples show both occur."],"forward_implications":["Computing the endomorphism ring for any module satisfying (1.1) becomes a finite algebraic search: compute the minimal polynomial of $\\pi$, then the integral closure of $A$ in $F(\\pi)$, then test candidate invariant factors against the divisibility constraints.","The reciprocity law from the authors' earlier paper is refined: all of $b_1,\\ldots,b_{r-1}$ get a Galois-theoretic meaning, not just $b_1$, so the full Frobenius index controls how the Frobenius at $p$ acts on division fields.","The matrix $F(p)$ is a universal Frobenius matrix: reducing it modulo $n$ gives the Frobenius conjugacy class in $\\mathrm{Gal}(F(\\Phi[n])/F)$ whenever the relevant Tate modules are free.","In rank 2 the method recovers the authors' earlier algorithm, and it gives closed formulas for $F(p)$ in terms of $b_1$ and the discriminant, matching the elliptic-curve analogue.","The Gorenstein analysis shows the freeness hypothesis is real: there are rank-3 examples where $E_l$ is not Gorenstein and $T_l(\\varphi)$ is not free over $E_l$, so the universal-matrix theorem is conditional rather than formal."],"supporting_citations":[{"why":"Supplies the order-basis theorem: any $A$-order containing $A[\\pi]$ has a basis $1, f_1(\\pi)/b_1, \\ldots, f_{r-1}(\\pi)/b_{r-1}$; this is the structural fact the whole computation rests on.","marker":"[18]"},{"why":"The authors' earlier reciprocity law and rank-2 algorithm; the present Theorem 3.1 refines its Theorem 1.2, and it also establishes that (1.1) holds when $k=\\mathbb{F}_p$.","marker":"[10]"},{"why":"Rank-2 prototype for the Frobenius matrix and splitting criterion, here generalized to arbitrary rank and to the full chain $b_1,\\ldots,b_{r-1}$.","marker":"[4]"},{"why":"The elliptic-curve prototype that first represented Frobenius in division fields by an explicit integral matrix; the model for Section 4.","marker":"[8]"},{"why":"Shows good reduction is unramified and gives the Frobenius-compatible isomorphism $T_l(\\Phi)\\cong T_l(\\varphi)$, used to transfer the matrix statement to division fields.","marker":"[24]"},{"why":"Gorenstein criteria and the theorem used to deduce freeness of $T_l(\\varphi)$ over $E_l$ from the Gorenstein property of $E_l$.","marker":"[2]"},{"why":"Provides the identification $E_l\\cong \\mathrm{End}_{A_l[G]}(T_l(\\varphi))$, which is the key step in the freeness theorem.","marker":"[26]"}],"fun_headline_variants":["Invariant factors determine Drinfeld endomorphism rings","Frobenius chain computes Drinfeld endomorphism rings","Efficient algorithm for Drinfeld endomorphism rings","Reciprocity law refined for Drinfeld division fields","Frobenius matrix from invariant factors"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on the commutativity assumption $[K:F]=r$—without it the endomorphism algebra is not a commutative field and the Frobenius index, the order basis, and the algorithm are undefined; Section 4 additionally depends on the freeness of each Tate module over the localized endomorphism ring, a condition the paper itself shows can fail.","fun_headline_variants_meta":{"raw":{"variants":["Invariant factors determine Drinfeld endomorphism rings","Frobenius chain computes Drinfeld endomorphism rings","Efficient algorithm for Drinfeld endomorphism rings","Reciprocity law refined for Drinfeld division fields","Frobenius matrix from invariant factors"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000968,"raw_usage":{"total_tokens":4163,"prompt_tokens":1033,"completion_tokens":3130,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":649,"completion_tokens_details":{"reasoning_tokens":3052}},"tokens_in":649,"tokens_out":3130,"duration_ms":19458,"temperature":1.0,"reasoning_tokens":3052,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:03:39.755209+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a rank-3 Drinfeld module satisfying (1.1), run the Section 3 search, and compute the invariant factors of $E/A[\\pi]$ independently by Smith normal form from the returned $A$-basis; if they differ from the returned $(b_1,b_2)$, the maximality theorem or the search is wrong. For Example 4.10, test the displayed matrices: if some $v\\in F_5^3$ makes $\\{v, e_2 v, e_3 v\\}$ linearly independent, then $\\varphi[l]$ is free over $E_l/lE_l$ and the paper's non-freeness claim fails.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the order-basis theorem: any $A$-order containing $A[\\pi]$ has a basis $1, f_1(\\pi)/b_1, \\ldots, f_{r-1}(\\pi)/b_{r-1}$; this is the structural fact the whole computation rests on."},{"cited_title":"Endomorphism rings of reductions of Drinfeld modules","cited_arxiv_id":null,"evidence_quote":"The authors' earlier reciprocity law and rank-2 algorithm; the present Theorem 3.1 refines its Theorem 1.2, and it also establishes that (1.1) holds when $k=\\mathbb{F}_p$."},{"cited_title":"C., and Papikian, M","cited_arxiv_id":null,"evidence_quote":"Rank-2 prototype for the Frobenius matrix and splitting criterion, here generalized to arbitrary rank and to the full chain $b_1,\\ldots,b_{r-1}$."},{"cited_title":"The splitting of primes in division fields of elliptic curves","cited_arxiv_id":null,"evidence_quote":"The elliptic-curve prototype that first represented Frobenius in division fields by an explicit integral matrix; the model for Section 4."},{"cited_title":"On the ubiquity of Gorenstein rings","cited_arxiv_id":null,"evidence_quote":"Gorenstein criteria and the theorem used to deduce freeness of $T_l(\\varphi)$ over $E_l$ from the Gorenstein property of $E_l$."},{"cited_title":"Isogenies of Drinfeld modules over finite fields","cited_arxiv_id":null,"evidence_quote":"Provides the identification $E_l\\cong \\mathrm{End}_{A_l[G]}(T_l(\\varphi))$, which is the key step in the freeness theorem."}],"review_version":1}