Ties in Function Field Prime Races
Pith reviewed 2026-05-15 01:54 UTC · model grok-4.3
The pith
In function fields, infinitely many collections of residue classes produce exact ties in prime counts for all N satisfying fixed congruence conditions.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that exceptional pairs of Galois-conjugate elements in the cyclotomic extensions produce exact cancellations inside the explicit formula for the prime counting functions, so that pi(N; m, c1) equals pi(N; m, c2) and so on for every N obeying a fixed set of congruence conditions; there are infinitely many such (m, c1, …, ck), the equality holds in characteristic 2, and an independent algebraic proof is obtained by exhibiting an explicit bijection coming from the GL_2(F_q) action on the residue classes.
What carries the argument
Exceptional Galois-conjugate pairs inside the cyclotomic extensions whose contributions cancel exactly in the explicit formula for pi(N; m, c), detected by a matrix analogue of Möbius inversion.
If this is right
- The ties hold for every N satisfying the congruence conditions, not merely for infinitely many N.
- Infinitely many distinct tuples (m, c1, …, ck) exhibit the tie phenomenon.
- The result remains valid in characteristic 2.
- Two independent proofs exist, one analytic via L-functions and one algebraic via group action.
Where Pith is reading between the lines
- The same cancellation mechanism could produce analogous ties in classical integer prime races if sufficiently exact conjugate cancellations occur among Dirichlet L-functions.
- The GL_2(F_q) bijection may extend to find ties in prime counts attached to higher-rank Drinfeld modules or other function-field settings.
- Systematic enumeration for small q and small degree m could list every tying collection and test the density of such examples.
Load-bearing premise
That exceptional pairs of Galois-conjugate elements exist in the cyclotomic extensions and produce exact cancellations in the explicit formula for the prime counting functions.
What would settle it
An explicit (m, c1, …, ck) together with a concrete N obeying the predicted congruence conditions for which the counts pi(N; m, ci) are unequal would falsify the claim.
read the original abstract
The function field analogue of Chebyshev's bias was first studied by Cha. In this paper, we study *ties* in this race, namely collections of distinct congruence classes $c_1, \dots, c_k \in (\mathbb{F}_q[T] / m)^\times$ for which $$\pi(N; m, c_1) = \pi(N; m, c_2) = \dots = \pi(N; m, c_k)$$ holds for infinitely many $N$. We provide infinitely many examples of $(m, c_1, \dots, c_k)$ for which the tie holds whenever $N$ satisfies certain congruence conditions. We give two different proofs: first, via the explicit formula for prime counts in terms of $L$-functions together with a matrix analogue of M\"obius inversion, where exceptional pairs of Galois-conjugate elements in the corresponding cyclotomic fields produce ties; and second, via an explicit bijection arising from the $\mathrm{GL}_2(\mathbb{F}_q)$-action. Our examples also include characteristic 2 cases.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies ties in the function field analogue of Chebyshev's bias: collections of distinct residue classes c1,...,ck mod m for which the prime counting functions π(N;m,ci) are exactly equal for infinitely many N. It constructs infinitely many such tuples (m,c1,...,ck) where equality holds whenever N satisfies specified congruence conditions, and supplies two proofs—one via the explicit formula for π(N;m,c) combined with a matrix analogue of Möbius inversion that exploits exceptional Galois-conjugate pairs in cyclotomic extensions, and a second via an explicit bijection induced by the GL2(Fq)-action—while also treating characteristic-2 cases.
Significance. If the constructions and cancellations are verified, the work supplies the first systematic supply of exact ties in function-field prime races, complementing existing bias results with both analytic (L-function) and algebraic (group-action) methods. The explicit provision of infinitely many examples and the dual proofs are concrete strengths; the inclusion of char-2 cases broadens applicability.
major comments (1)
- [explicit formula proof] Explicit-formula proof (discussion of Galois-conjugate pairs and matrix Möbius inversion): the argument shows that selected Galois-conjugate pairs cancel, but does not verify that the full linear combination ∑_χ χ(ci)·(∑_ρ x^ρ/ρ) is identical across the tied classes ci once all non-principal characters χ mod m and all zeros are included. The congruence condition on N must be shown to annihilate or symmetrize any unmatched orbits; without this step the exact equality π(N;m,c1)=⋯=π(N;m,ck) is not yet established.
minor comments (1)
- The abstract refers to a 'matrix analogue of Möbius inversion' without a one-sentence definition or pointer to the precise matrix construction; a brief clarifying sentence in the introduction would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for highlighting a point in the explicit-formula argument that merits additional clarification. We address the comment below and will revise the manuscript to make the verification explicit.
read point-by-point responses
-
Referee: [explicit formula proof] Explicit-formula proof (discussion of Galois-conjugate pairs and matrix Möbius inversion): the argument shows that selected Galois-conjugate pairs cancel, but does not verify that the full linear combination ∑_χ χ(ci)·(∑_ρ x^ρ/ρ) is identical across the tied classes ci once all non-principal characters χ mod m and all zeros are included. The congruence condition on N must be shown to annihilate or symmetrize any unmatched orbits; without this step the exact equality π(N;m,c1)=⋯=π(N;m,ck) is not yet established.
Authors: We appreciate the referee drawing attention to this step. In the proof, the matrix analogue of Möbius inversion is applied to the full character table (including all non-principal χ mod m), which decomposes into blocks corresponding to Galois orbits. The exceptional conjugate pairs are selected precisely so that their contributions to the linear combination cancel identically for each tied class c_i. The remaining (non-exceptional) orbits are symmetrized by the same inversion, and the congruence condition imposed on N annihilates the unmatched terms because the associated character sums over the residue classes become equal by the orbit-stabilizer relation in the cyclotomic extension. We will insert a short paragraph (new Lemma 3.4 and the ensuing paragraph) that explicitly computes the difference of the full sums and verifies that it vanishes under the stated congruence on N. This addition will be included in the revised manuscript. revision: yes
Circularity Check
No significant circularity; derivations use independent L-function theory and group actions
full rationale
The paper constructs ties via explicit formulas for prime counts (standard in function field arithmetic) combined with matrix Möbius inversion on Galois orbits, plus an independent GL_2(F_q) bijection. No quoted step reduces a claimed prediction or tie to a fitted parameter, self-definition, or load-bearing self-citation chain. The central examples are exhibited by explicit construction rather than by renaming or ansatz smuggling. This matches the default expectation of a self-contained derivation against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Explicit formula for prime counting functions in terms of L-function zeros holds in function fields
- standard math Matrix analogue of Möbius inversion applies to the character sums in the explicit formula
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.