Pith.

Number Theory · arXiv:2606.28989 v2 · submitted 27 Jun 2026 · 5 references

Point counts of abelian varieties over finite fields determining their zeta function

Shiva Chidambaram, Timo Keller

The paper says

“Let A be an abelian variety of dimension g over a finite field Fq.”

more of the abstract

We show that if q is sufficiently large relative to g, the g point counts #A(Fqi) for 1 ≤ i ≤ g determine the zeta function of A, equivalently the characteristic polynomial of its Frobenius endomorphism, and hence the isogeny class of A. This count is best possible for g = 2 and g = 4, but not in general: for g = 3 two point counts already determine the zeta function, whereas a single count never does. The proof combines the functional equation of the L-polynomial with Newton's identities and an inductive error analysis that controls the power sums of the inverse Frobenius eigenvalues with enough precision to recover them, as integers, by rounding.

from the abstract

Pith says

Machine review · grok-4.5 · 15 Jul 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up. Clean, constructive improvement: g point counts determine the zeta function for large q, with matching optimality for small g and a largely formalized proof. This line is wrong

4 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 5 references say.

4 minor objections

The paper says, at Place not named

Pith says: minor objection 1 of 4

Remark 7.6 already sketches how replacing the crude p(2g) bound by the partition generating function yields Q(g)=e^{O(g log g)}. It would be helpful to state this improved bound as a formal corollary or remark with the corresponding D=O(g^2), so that readers do not have to reconstruct the arithmetic.

The paper says, at Place not named

Pith says: minor objection 2 of 4

In the proof of Theorem 1.1 (Section 6), the final comparison 2g D^g < q^{g/4} is reduced to q>D^{2g+2} via D≥2g. A one-line verification that the same inequality holds under the slightly weaker hypothesis q>D^{2g} (already used for the base case) would make the constant bookkeeping tighter.

show 2 more

The paper says, at Place not named

Pith says: minor objection 3 of 4

The Lean formalization is a genuine strength; briefly listing the two remaining sorries (infinite Möbius inversion and the explicit Waring formula) already in the introduction or abstract would advertise the completeness of the checked core more clearly.

The paper says, at Place not named

Pith says: minor objection 4 of 4

Notation: the same symbol Δ is used both for an error and for a bound on that error (end of Section 2). A short clarifying sentence would avoid momentary confusion when reading the induction.

What would settle it

Independently re-derive the final error estimate for Δs_i in the proof of Theorem 1.1 (page 8) from the induction hypothesis of Lemma 5.2 and the seed bound of Lemma 5.3, without using the crude factor p(2g); confirm that the same chain still yields Δs_i <½ q^{-i} once q>D^{2g+2}. If the inequality continues to hold, the present Q(g) is merely unoptimized, not incorrect.

from the skeptic's reading

How the review went

4 readings by grok-4.5 · 15 Jul 2026

  1. Reader holds up confidence high
  2. Skeptic agrees 7 s · 16,925 tokens read, 622 written
  3. Editor wrote the verdict above 4 s · 17,834 tokens read, 463 written
  4. Referee accept: 4 minor 7 s · 17,211 tokens read, 775 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

The new result is simple to state: once q exceeds an explicit (huge) Q(g), the first g point counts of a g-dimensional abelian variety over Fq determine its L-polynomial, hence its isogeny class. Kedlaya already had 2g counts for q > 256 g2; this halves the count by combining the functional equation with Newton identities and an inductive error analysis that recovers the power sums si by rounding. That induction (Lemma 5.2) is the technical heart, and it is carefully budgeted.

What the paper does well is make the argument fully constructive and checkable. Constants are explicit, the small-range Möbius truncation and large-range induction are written with complete error budgets, and the accompanying Sage/Python scripts verify the recovery algorithm and the explicit Weil-polynomial families that prove N(2)=2, N(4)=4 and N(3)=2. The Lean formalization covers the inductive core (only two standard classical identities remain as sorries). That is real evidence, not decoration.

The soft spot is the size of Q(g). The contraction constant D = 16 g3 p(2g) is crude; the paper itself (Remark 7.6) already sketches how a sharper partition-sum estimate drops the bound to eO(g log g). That is an optimization, not a correctness gap. The optimality statements stop at g=4; for g≥5 the question whether g is sharp is left open, which is honest. No circularity, no free parameters, citations are appropriate.

This is for people who care about computational arithmetic geometry or effective Tate theorems. The math is solid, the data are reproducible, and a serious editor should send it to referees. I would engage with it.

The strongest objection

The central claim of Theorem 1.1 is that the g point counts determine f_A once q exceeds an explicit (albeit huge) Q(g). The recovery rests on three elementary pillars that the paper establishes carefully: (i) q^n s_n is an integer (Lemma 2.4), so rounding works once the additive error is <½ q^{-n}; (ii) the functional equation and Newton identities reduce the problem to recovering s_1,…,s_g; (iii) the inductive error bound of Lemma 5.2, seeded by the truncated Möbius inversion of Lemma 4.1 and the base comparison of Lemma 5.3, keeps every Δs_j inside its budget B_j. The reader correctly notes that the contraction constant D=16g^{3}p(2g) is crude and forces a super-exponential threshold; the paper itself (Remark 7.6) already shows how a sharper partition-sum estimate would replace p(2g) by O(g/D) and yield only e^{O(g log g)}. That is an optimization, not a correctness gap. The argument as written is self-contained, the rounding thresholds are verified, the small-g optimality families are explicit and computer-checked, and the Lean formalization covers the technical heart (Lemma 5.2) without gaps. No hidden assumption or internal inconsistency threatens the stated theorem.

The reader’s weakest-assumption note correctly isolates the size of D and the resulting super-exponential Q(g). That size is an artefact of a deliberately crude partition bound, not a logical flaw: every inequality in Lemmas 5.2–5.3 and the final rounding step is elementary and closes for the stated D. The paper already sketches (Remark 7.6) how a generating-function estimate removes the p(2g) factor, confirming that the authors understand the limitation. The Lean formalization of the inductive core, the accompanying Sage scripts that recover f_A and verify the g=2,3,4 families, and the absence of free parameters or circular appeals all reinforce that the theorem is correctly proved as stated. No adjustment of the ACCEPT verdict is warranted.

The referee's report

The result sharpens the classical expectation that 2g point counts determine f_A down to g counts for large q, and shows that g is optimal for g=2,4 but not for g=3. The proof is fully explicit, constructive, and accompanied by machine-checked formalization of the inductive heart (Lemma 5.2) together with reproducible verification scripts for the optimality families. These strengths make the contribution solid and usable for computational arithmetic geometry, even though the constant Q(g) is far from optimal (as the authors themselves discuss in Remark 7.6).

Pith's reading of the paper (a machine's summary, not the authors')

An abelian variety over a finite field has a zeta function that packages all of its point counts and completely determines its isogeny class. The authors prove that once the field size q is larger than an explicit (though enormous) function of the dimension g, it is enough to know only the g counts over the extensions of degree 1 through g; those data recover the full L-polynomial of Frobenius. The argument works by converting the counts into approximate power sums of the inverse eigenvalues, then sharpening those approximations inductively with Newton identities and the functional equation until each power sum can be rounded to the unique integer it must be. The same count is optimal for dimensions 2 and 4, yet for dimension 3 already two counts suffice, so the “g measurements for g unknowns” heuristic is not always sharp.

What carries the argument. An inductive error analysis on the power sums s_n of the inverse Frobenius eigenvalues: the functional equation and Newton identities express the doubled sums s_{2i} in terms of previously known lower sums, the resulting error is driven below ½ q^{-i}, and integrality then recovers each s_i by rounding.

Core claim. If A is a g-dimensional abelian variety over F_q and q exceeds the explicit threshold Q(g)=(16 g^3 p(2g))^{2g+2}, then the g numbers #A(F_{q^i}) for 1≤i≤g determine the L-polynomial of A, hence its zeta function and its isogeny class. For g=2 and g=4 this number of counts is best possible, while for g=3 two counts already determine the zeta function for every prime power q≥16, and a single count never suffices for any g≥2.

The premise it rests on. The induction that sharpens the error bounds only closes when the contraction constant is taken as large as 16 g cubed times the partition number p(2g), which forces the field-size threshold to be super-exponential in g.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by grok-4.5, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper · Review history (2 versions)

The paper

Abstract

Let A be an abelian variety of dimension g over a finite field Fq. We show that if q is sufficiently large relative to g, the g point counts #A(Fqi) for 1 ≤ i ≤ g determine the zeta function of A, equivalently the characteristic polynomial of its Frobenius endomorphism, and hence the isogeny class of A. This count is best possible for g = 2 and g = 4, but not in general: for g = 3 two point counts already determine the zeta function, whereas a single count never does. The proof combines the functional equation of the L-polynomial with Newton's identities and an inductive error analysis that controls the power sums of the inverse Frobenius eigenvalues with enough precision to recover them, as integers, by rounding.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-09-23

The authors' main claim, as the classifier picked it out 1.00

“We show that if $q$ is sufficiently large relative to $g$, the $g$ point counts $\#A(\mathbf{F}_{q^i})$ for $1 \leq i \leq g$ determine the zeta function of $A$, equivalently the characteristic polynomial of its Frobenius endomorphism, and hence the isogeny class of $A$.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.89 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.94 · compares with prior results 0.21 · mentions code or data availability 0.01

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v2). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Let $A$ be an abelian variety of dimension $g$ over a finite field $\mathbf{F}_q$. background 1.00 0.05 0.01 unclear 0.61
We show that if $q$ is sufficiently large relative to $g$, the $g$ point counts $\#A(\mathbf{F}_{q^i})$ for $1 \leq i \leq g$ determine the zeta function of $A$, equivalently the characteristic polynomial of its Frobenius endomorphism, and hence the isogeny class of $A$. result 0.93 0.95 0.95 asserted 1.00
This count is best possible for $g=2$ and $g=4$, but not in general: for $g=3$ two point counts already determine the zeta function, whereas a single count never does. result 0.87 0.85 0.12 asserted 1.00
The proof combines the functional equation of the $L$-polynomial with Newton's identities and an inductive error analysis that controls the power sums of the inverse Frobenius eigenvalues with enough precision to recover them, as integers, by rounding. method 1.00 0.90 0.04 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v2

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,857 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

References (5)
  1. [1] Shiva Chidambaram and Timo Keller, Accompanying code for ``point counts of abelian varieties over finite fields determining their zeta function'', GitHub repository https://github.com/TimoKellerMath/PointCountsAbelianVarieties , 2026, Sage / Python scripts recover\_zeta.sage ,... on Pith
  2. [2] Stephen A. DiPippo and Everett W. Howe, Real polynomials with all roots on the unit circle and abelian varieties over finite fields, J. Number Theory 73 (1998), no. 2, 426--450. 1657992 on Pith
  3. [3] Kiran S. Kedlaya, Quantum computation of zeta functions of curves, Comput. Complexity 15 (2006), no. 1, 1--19. 2226067 on Pith
  4. [4] The LMFDB Collaboration , The L -functions and modular forms database , https://www.lmfdb.org, 2026, [Online; accessed 25 June 2026] on Pith
  5. [5] I. G. Macdonald, Symmetric functions and H all polynomials , second ed., Oxford Classic Texts in the Physical Sciences, The Clarendon Press, Oxford University Press, New York, 2015, With contribution by A. V. Zelevinsky and a foreword by Richard Stanley. 3443860 on Pith
Cited by 1 Pith paper

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment