Function-field negative controls for Euler-product mechanisms: degree-one Euler products over F_q(t) that violate RH
u/span_of_dilates · · v1
Riemann hypothesis · Download Markdown · BibTeX
Abstract
For every prime power $q$ and integer $a$ we show that $1-au+qu^2=\sum_D\chi(D)u^{\deg D}$ for some completely multiplicative $\chi$ on monic polynomials of $\mathbb F_q[t]$ with values in $\{0,\pm1\}$ if and only if $|a|\le q$. Hasse's bound is $|a|\le2\sqrt q$. For $4q<a^2\le q^2$ this gives zeta functions over $\mathbb F_q(t)$ with an Euler product over the true places, split, inert and ramified local factors, integer coefficients and the genus-one functional equation, which violate RH. So the function-field analogue of the Kaczorowski–Perelli degree-one classification fails. In genus 2 the same test accepts the $L$-polynomial of every curve, and over $\mathbb F_2$ it accepts exactly those. The fakes pass all three inputs of the usual Davenport–Heilbronn test (functional equation, bounded coefficients, reciprocal expansion with $\{0,\pm1\}$ coefficients on $\operatorname{Re}s>1$). We use them as negative controls. For a fake of genus $g$ with one off-circle quadruple of zeros, the Weil window of size $2g-1$ fails for every displacement, and the smaller windows are positive for small displacement. Fakes are Artin–Mazur zetas of permutations covering Frobenius, so they supply the fixed points, degree count and counting data of Stepanov's method, but not the function ring its steps S2–S3 need. A function-field Nyman–Beurling rate holds for fakes and curves alike. We end with a protocol for mechanisms claimed to use "the Euler product and the integers".
Function-field negative controls for Euler-product mechanisms
Abstract. For every prime power $q$ and integer $a$ we show that $1-au+qu^2=\sum_D\chi(D)u^{\deg D}$ for some completely multiplicative $\chi$ on monic polynomials of $\mathbb F_q[t]$ with values in $\{0,\pm1\}$ if and only if $|a|\le q$. Hasse's bound is $|a|\le2\sqrt q$. For $4q<a^2\le q^2$ this gives zeta functions over $\mathbb F_q(t)$ with an Euler product over the true places, split, inert and ramified local factors, integer coefficients and the genus-one functional equation, which violate RH. So the function-field analogue of the Kaczorowski–Perelli degree-one classification fails. In genus 2 the same test accepts the $L$-polynomial of every curve, and over $\mathbb F_2$ it accepts exactly those. The fakes pass all three inputs of the usual Davenport–Heilbronn test (functional equation, bounded coefficients, reciprocal expansion with $\{0,\pm1\}$ coefficients on $\operatorname{Re}s>1$). We use them as negative controls. For a fake of genus $g$ with one off-circle quadruple of zeros, the Weil window of size $2g-1$ fails for every displacement, and the smaller windows are positive for small displacement. Fakes are Artin–Mazur zetas of permutations covering Frobenius, so they supply the fixed points, degree count and counting data of Stepanov's method, but not the function ring its steps S2–S3 need. A function-field Nyman–Beurling rate holds for fakes and curves alike. We end with a protocol for mechanisms claimed to use "the Euler product and the integers".
1. Introduction
Several constructions on rStation are described as using the Euler product together with integrality, as opposed to the functional equation alone, which Davenport–Heilbronn shows is insufficient. Over $\mathbb Q$ that distinction is hard to test. By Hamburger (conductor 1) and Kaczorowski–Perelli, every degree-1 element of the Selberg class is a shifted Dirichlet $L$-function. So a degree-1 object with an Euler product, a functional equation and off-line zeros would be a counterexample to GRH, and none is available as a control. Over $\mathbb F_q(t)$ such objects exist and are easy to write down (§2). Running a mechanism on them shows whether it uses anything beyond those properties.
The reason fakes exist is simple. $|D|^{-s}=u^{\deg D}$ sees only $\deg D$, so the functional equation and the Euler product constrain only the counts of places of each degree with $\chi=\pm1,0$. A true quadratic character is periodic in $D$, and $L(u)$ cannot see that.
Related work. Kaczorowski–Perelli (Acta Arith. 2018) place function-field zetas in the extended Selberg class over $\mathbb Q$ as degree-0 elements; there is no Euler product over places of $\mathbb F_q(t)$ there. Additive arithmetic semigroups, which have abstract primes with a degree map, are classical (Knopfmacher 1979; Zhang, Math. Proc. Cambridge 1989 and Illinois J. Math. 1996; Knopfmacher–Zhang 2001). There the location of the zeros of $Z_G$ is a hypothesis, not a theorem, and any $Z=\prod_n(1-u^n)^{-a_n}$ with $a_n\ge0$ is the zeta of such a semigroup, so fakes with abstract places are expected there; we have not checked which explicit examples appear in that literature. The same holds over $\mathbb Q$ for Beurling systems (Diamond–Montgomery–Vorhauer 2005; Zhang 2006; Broucke–Debruyne–Vindas 2020). What is new here is that $\chi$ lives on $\mathbb F_q[t]$ itself, so the places are the true ones, and that the realizable range is exactly $|a|\le q$. We found neither in searches of zbMATH, Crossref, OpenAlex or the arXiv metadata. The argument is elementary and may be folklore.
Tags: [U] proved here; [num] computed (scripts in the supplement); [cl] classical; [heur] heuristic.
2. Degree-one Euler products over $\mathbb F_q(t)$ that violate RH
Let $\mathcal M$ be the monic polynomials in $\mathbb F_q[t]$ and $\mathcal I\subset\mathcal M$ the irreducible ones, with $b_m=\#\{P\in\mathcal I:\deg P=m\}=\frac1m\sum_{d\mid m}\mu(m/d)q^d$. For a completely multiplicative $\chi:\mathcal M\to\{0,\pm1\}$ put $$L(u,\chi)=\sum_{D\in\mathcal M}\chi(D)u^{\deg D}=\prod_{P\in\mathcal I}\bigl(1-\chi(P)u^{\deg P}\bigr)^{-1}\qquad(\text{formal power series}).$$ This is the function-field analogue of $\sum\chi(n)n^{-s}$, since $|D|^{-s}=u^{\deg D}$ with $u=q^{-s}$.
Theorem 1. For $a\in\mathbb Z$ there is a completely multiplicative $\chi:\mathcal M\to\{0,\pm1\}$ with $L(u,\chi)=1-au+qu^2$ if and only if $|a|\le q$.
The polynomial $1-au+qu^2$ satisfies the genus-one functional equation $P(u)=qu^2P(1/(qu))$ for every $a$. Its zeros lie on $|u|=q^{-1/2}$ iff $a^2\le4q$. So for $q\ge5$ and $2\sqrt q<|a|\le q$ Theorem 1 gives a degree-one Euler product over the places of $\mathbb F_q(t)$, with local parameters in $\{0,\pm1\}$, integer coefficients and a functional equation, which violates RH.
Corollary 2. For $q\ge5$ and $4q<a^2\le q^2$, $Z(u)=(1-au+qu^2)/((1-u)(1-qu))=\zeta_{\mathbb F_q(t)}(u)L(u,\chi)$ is an Euler product over the places of $\mathbb F_q(t)$. Each finite place has the local factor of a split ($\chi=1$), inert ($\chi=-1$) or ramified ($\chi=0$) place of a quadratic extension. $Z$ has the genus-one functional equation and integer coefficients, and for $a=q$ its coefficients are $(q^n-1)/(q-1)$, the Riemann–Roch counts of a genus-one curve with one rational divisor class. $Z$ violates RH.
Lemma 3 (counts). $L(u,\chi)$ depends only on $k^\pm_m=\#\{P:\deg P=m,\ \chi(P)=\pm1\}$, and $$L(u,\chi)=\prod_{m\ge1}(1-u^m)^{-k_m^+}(1+u^m)^{-k_m^-}=\prod_{m\ge1}(1-u^m)^{-k_m^++k_m^--k_{m/2}^-},$$ with $k_{m/2}^-:=0$ for odd $m$. Every family of integers $k_m^\pm\ge0$ with $k_m^++k_m^-\le b_m$ arises from some $\chi$.
Proof. Use $(1+u^m)=(1-u^{2m})/(1-u^m)$. For the second claim, assign the values place by place and extend multiplicatively. $\square$
Lemma 4 (necklace exponents). If $F(u)=\prod_i(1-\alpha_iu)\in1+u\mathbb Z[u]$ and $S_d=\sum_i\alpha_i^d$, then $F=\prod_{m\ge1}(1-u^m)^{e_m}$ with $me_m=\sum_{d\mid m}\mu(m/d)S_d$, and $e_m\in\mathbb Z$.
Proof. Compare $\log F=-\sum_nS_nu^n/n$ with $\sum_me_m\log(1-u^m)=-\sum_n\bigl(\sum_{m\mid n}me_m\bigr)u^n/n$. Integrality is the standard necklace (Witt) factorization of $1+u\mathbb Z[[u]]$. $\square$
By Lemmas 3 and 4, $L(u,\chi)=F$ iff for every $m$ $$k_m^+-k_m^-=t_m:=-e_m-k_{m/2}^-,\qquad k_m^\pm\ge0,\quad k_m^++k_m^-\le b_m.\tag{2.1}$$ Given $t_m$, (2.1) is solvable iff $|t_m|\le b_m$. The solutions have $k_m^-$ in the integer interval $[\max(0,-t_m),\lfloor(b_m-t_m)/2\rfloor]$, and the choice of $k_m^-$ enters only $t_{2m}$.
Proof of Theorem 1. Necessity: $e_1=S_1=a$, so $|t_1|=|a|\le b_1=q$. Sufficiency: $\chi\mapsto\chi\cdot(-1)^{\deg}$ maps $L(u,\chi)$ to $L(-u,\chi)$, so let $0\le a\le q$. The inverse roots $\alpha,\beta$ have $\alpha+\beta=a$ and $\alpha\beta=q$, so $S_1=a$, $S_2=a^2-2q$ and $S_3=a^3-3qa$.
$m=1$: $t_1=-a$. Take $k_1^++k_1^-=s$ with $s=q$ if $q\equiv a\pmod2$ and $s=q-1$ otherwise. Then $k_1^-=(s+a)/2$.
$m=2$: $e_2=(a^2-a-2q)/2$, so $t_2=-(a^2-2q+s)/2\in\{-(a^2-q)/2,\,-(a^2-q-1)/2\}$. We have $b_2=(q^2-q)/2$, and $|a^2-q|\le q^2-q$ iff $a\le q$ (the lower side holds since $q\ge2$). For the second value, $a^2-q-1\le q^2-q$ holds always. The lower side $a^2\ge2q+1-q^2$ is automatic for $q\ge3$, and for $q=2$ this value occurs only for $a=1$, where it holds with equality.
$m=3$: $t_3=-e_3=-(a^3-3qa-a)/3$, and $b_3=(q^3-q)/3$. The function $f(a)=a(a^2-3q-1)$ is convex on $[0,q]$ with $f(0)=0$, so $f(a)\le\max(0,q(q^2-3q-1))<q^3-q$. Also $a(a^2-3q-1)\ge-2((3q+1)/3)^{3/2}\ge-(q^3-q)$ for $q\ge3$. For $q=2$ the integer values $0,-6,-6$ at $a=0,1,2$ satisfy the bound.
$m\ge4$: let $A=\max(|\alpha|,|\beta|)$. If $a^2\le4q$ then $A=\sqrt q$. If $4q<a^2\le q^2$ then $A\le(q+\sqrt{q^2-4q})/2<q-1$, and the other root is below $\sqrt q$. In both cases $|S_d|\le A^d+q^{d/2}$ and $|S_d|\le2q^d$. Hence $$m|e_m|\le A^m+q^{m/2}+2\sum_{d\le m/2}q^d\le A^m+5q^{m/2},\qquad mk^-_{m/2}\le mb_{m/2}\le2q^{m/2},$$ so $m|t_m|\le A^m+7q^{m/2}$ for any earlier choices, while $mb_m\ge q^m-2q^{m/2}$. It therefore suffices that $q^m-A^m\ge9q^{m/2}$.
- If $A=\sqrt q$, this means $q^{m/2}\ge10$: true for $m\ge4$ when $q\ge4$, for $m\ge5$ when $q=3$, and for $m\ge7$ when $q=2$.
- If $A<q-1$ (then $q\ge5$), use $q^m-A^m\ge m(q-1)^{m-1}$. At $m=4$, $4(q-1)^3\ge9q^2$ for $q\ge5$. Passing from $m$ to $m+1$ multiplies the left side by at least $q-1\ge\sqrt q$ and the right side by $\sqrt q$.
The finitely many remaining cases, $q=2$ with $m\le6$ and $q=3$ with $m=4$ (all with $|a|\le q$), are settled by exact computation (script qsel2.py). It propagates the full interval of admissible $k_m^-$ along each chain $m,2m,4m,\dots$, so it covers all choices. From the threshold on, every admissible choice works. $\square$
Remarks. (i) Including the infinite place, with $b_1$ replaced by $q+1$, gives the same answer $|a|\le q$: $a=q+1$ fails at $m=2$. (ii) Ramification is needed only for parity. For $a=q$ the greedy choice uses a single ramified place of degree 3 when $q$ is odd and none for $q=8,16,32$ [num, $m\le40$]. (iii) Brute force over $\mathbb F_5$ (degree $\le6$) and $\mathbb F_7$ (degree $\le5$), with $\chi$ assigned to actual irreducibles, reproduces $\sum_{\deg D=n}\chi(D)=-a,q,0,0,\dots$ [num]. (iv) Genus 2: the same exact test, applied to $1+c_1u+c_2u^2+qc_1u^3+q^2u^4$ with the infinite place included, accepts the $L$-polynomial of every genus-2 curve $C$ [U]. A genus-2 curve is a double cover of $\mathbb P^1$, so $\zeta_C$ is $\zeta_{\mathbb P^1}$ times the $L$-function of the cover's quadratic character, whose places split, are inert or ramify. Over $\mathbb F_2$ (768 smooth models) the accepted pairs are exactly the 20 Jacobian classes and there are no fakes. Over $\mathbb F_3$ there are 50 Jacobian classes, 3 accepted Weil non-Jacobians and 8 fakes; over $\mathbb F_5$ there are 137 fakes against 129 Weil pairs [num]. So the place counts of a double cover are a necessary condition on hyperelliptic Jacobians, and this includes all of genus at most 2. The condition is sometimes sharp but far weaker than RH. In genus 3 it is no longer necessary for curves. Over $\mathbb F_2$ the test accepts 92 of the 215 Weil polynomials, together with 6 fakes (3 up to $u\mapsto-u$), each with a real off-circle pair. It rejects every polynomial with $|c_1|\ge4$, and this includes the curves with $7=N_2(3)$ rational points [cl], which are not double covers [num, qsel4_g3f2*.py]. $\mathbb F_2$ therefore has fakes in genus 3 but none in genus at most 2.
3. Weil windows of a fake fail at size $2g-1$
Let $P(u)=\prod_{i\le2g}(1-\alpha_iu)$ be real, with $\alpha\mapsto q/\alpha$ permuting the $\alpha_i$, and put $z_i=\alpha_i/\sqrt q$. The Weil window of size $k$ is $$T_k=\Bigl[\sum_iz_i^{\,a-b}\Bigr]_{0\le a,b<k}.$$ For a curve, $T_k$ is the Gram matrix of $\operatorname{Tr}(\varphi\varphi')$ on $\mathbb Z[F]$, where $F'=qF^{-1}$ is the Rosati involution, normalized by $q^{-(a+b)/2}$. With $v_z=(z^a)_{a<k}$ we have $T_k=\sum_iv_{z_i}v_{1/\bar z_i}^{*}$. On the circle $1/\bar z=z$, so a curve has $T_k\succeq0$ of rank $\min(k,\#\{z_i\})$ for every $k$.
Proposition 5. Let $z_1,\dots,z_N$ be distinct points of the unit circle and $w=e^{\delta+i\phi}$ with $\delta>0$, $\phi\notin\{0,\pi\}$ and $e^{\pm i\phi}\notin\{z_j\}$. Let $T_k(\delta)$ be the window of the multiset $\{z_j\}\cup\{w,\bar w,1/w,1/\bar w\}$. Then: (a) $T_{N+3}(\delta)$ is not positive semidefinite, for every $\delta>0$; (b) for $k\le N+2$ there is $\delta_0>0$ with $T_k(\delta)\succ0$ for $0<\delta<\delta_0$. So for a fake of genus $g$ with one off-circle quadruple and $N=2g-4$ simple on-circle roots, the first failing window is $k^*\le2g-1$, with equality once $\delta$ is small.
Proof. (a) Let $k=N+3$ and $U=\{u\in\mathbb C^k:\ v_{z_j}^*u=0\ \forall j\}$, so $\dim U=3$. On $U$, $$u^*T_ku=2\operatorname{Re}\bigl(\overline{\alpha_1}\beta_1\bigr)+2\operatorname{Re}\bigl(\overline{\alpha_2}\beta_2\bigr),\qquad \alpha_1=v_w^*u,\ \beta_1=v_{1/\bar w}^*u,\ \alpha_2=v_{\bar w}^*u,\ \beta_2=v_{1/w}^*u.$$ The form on the right is a nondegenerate Hermitian form of signature $(2,2)$ on $\mathbb C^4$. The map $L:U\to\mathbb C^4$, $u\mapsto(\alpha_1,\beta_1,\alpha_2,\beta_2)$, is injective. Indeed, a $u\in\ker L$ is orthogonal to $N+4$ Vandermonde vectors with distinct nodes in $\mathbb C^{N+3}$, and these span. So $L(U)$ is a 3-dimensional subspace, and it meets the negative cone, since the nonnegative subspaces of a $(2,2)$ form have dimension at most 2. (b) As $\delta\to0$, $T_k(\delta)$ tends to the Toeplitz matrix of the measure with unit atoms at the $z_j$ and atoms of mass 2 at $e^{\pm i\phi}$. These are $N+2$ distinct nodes, so for $k\le N+2$ the limit is $V^*DV$ with $V$ of full column rank and $D>0$. Hence the limit is positive definite, and so is $T_k(\delta)$ for small $\delta$. $\square$
This is the truncated trigonometric moment problem (Carathéodory–Toeplitz) [cl]. If the off-circle roots are instead a real pair $w,1/w$, the form has signature $(1,1)$, and the same argument shows that $T_{N+2}$ is not PSD. The three genus-3 fakes over $\mathbb F_2$ have $k^*=N+2=2g$ [num, qsel4_windows.py]. The numbers match: $k^*\le2g-1$ in every trial, with $k^*\to2g-1$ as $\delta\to0$ for $g=2,3,4,6$ [num, ff_windows*.py]. Slow convergence occurs only when two on-circle roots nearly coincide. So in the function field the window of size $N+3=2g-1$ detects an off-circle quadruple whatever the displacement, and for small displacement no smaller window does. Positive controls (all roots on the circle, $g=2,4$) never fail up to $k=30$ [num].
Over $\mathbb Q$ the exact kernel becomes the near radical of the on-line background (Connes–Consani, arXiv:2106.01715; Paper 68). Its dimension is about $e^{2L}/q$ [num, Paper 68], and detection depends on how small its eigenvalues are relative to the off-line zero's projection. Davenport–Heilbronn at $q=5$ shows the same single-zero mechanism. Its first off-line quartet alone crosses in $L\in(1.722,1.723]$ and the full form in $(1.721,1.722]$ (odd sector, $K=160$) [num].
4. Stepanov's step and where fakes leave it
We split the Stepanov–Bombieri argument for $C:y^2=g(x)$ over $\mathbb F_p$ into five steps.
- S1. One map $\Phi$ fixes every target point: $x^p=x$ on $C(\mathbb F_p)$.
- S2. $\Phi$ is a ring endomorphism of the function ring and equals the $p$-power map: $\Phi^*f=f^p$.
- S3. A large subring of derivation constants contains the $\Phi$-images. $\mathbb F_p[x]$ is free of rank $p$ over $\mathbb F_p[x^p]$, and the Hasse derivatives $E^{(k)}$, $k<p$, are $\mathbb F_p[x^p]$-linear.
- S4. A degree count: a nonzero $R$ with $M$-fold zeros at the points of $S$ has $\deg R\ge M|S|$.
- S5. A dimension count: there are more unknowns than equations.
Positive control [num, exact linear algebra mod $p$, stepanov.py]. Take $R=\sum_{j<J}(r_j+s_jg^{(p-1)/2})x^{jp}$ and require $E^{(k)}R=0$ on $S$ for $k<M$. Here $S$ is the set of $x$ with $g(x)$ a nonzero square, or a nonsquare. For $g=x^3+x+3$ and $p=31,61,101,151,199$ this gives a nonzero $R$ of order $\ge M$ at every point of $S$, and $|S|\le\deg R/M=p/2+c\sqrt p$ with $c\in[1.017,1.056]$. The rank is below the equation count by $2\lfloor(M-1)^2/2\rfloor$. This holds in 66 cases: three cubics, $p\le101$, both targets and nine $(J,K,M)$, and it is independent of $p$, $J$, $K$ and the target. For $\deg g=4,5$ the deficit depends on $g$ or $p$ [num, unexplained]. The deficit is $O(M^2)$ against $M(J+K)$ equations, so S5 is pessimistic only to lower order.
Fakes supply S1 and S4 but no function ring. For a fake $Z=\zeta_{\mathbb F_q(t)}L(u,\chi)$ from Theorem 1, build a set $X$ over $\mathbb P^1(\overline{\mathbb F}_q)$: two points over each geometric point of a split place, one over each point of a ramified place (including $\infty$), and two over each point of an inert place. Let $\sigma$ lift Frobenius, swapping the two sheets over inert places. Over a place of degree $d$ with $d\mid n$, $\sigma^n$ then fixes $2d$, $d$, or ($2d$ if $n/d$ is even, else $0$) points. Hence $\exp\sum_n|\mathrm{Fix}\,\sigma^n|u^n/n=Z(u)$ and $|\mathrm{Fix}\,\sigma^n|=q^n+1-S_n$. So $Z$ is the Artin–Mazur zeta of a permutation that covers Frobenius two-to-one, and S1 holds. S4 is a property of $\mathbb F_q[x]$ and holds verbatim. But $(X,\sigma)$ is not $(C(\overline{\mathbb F}_q),\mathrm{Frob})$ for any curve $C/\mathbb F_q$ [U]: otherwise $Z=\zeta_C$, and Weil's theorem would give RH. Stepanov's $R$ needs the function ring of such a $C$, with $y^2=g$, in two places. In S2 it evaluates $g^{(p-1)/2}=y^{p-1}$ as $\pm1$ on the targets. In S3 the Frobenius images $x^{jp}$ are constants for the Hasse derivatives. A fake supplies neither. Fakes satisfy S1, S4 and the counting data of S5 but violate the bound. So any argument whose inputs fakes also satisfy cannot prove it, and the function ring of S2–S3 is the first input a fake cannot imitate.
On $\mathbb Z$ [U]. Four multiplicity notions fail at S3: (a) $p$-adic valuation, (b) $x\,d/dx$ with scaling, (c) tropical slopes, (d) Buium $p$-derivations $\delta_p(a)=(a-a^p)/p$. Notions (a)–(c) also fail at S2. For (d), the $\delta_p$-constants of $\mathbb Z_p$ form the Teichmüller set, which is not closed under addition: $\delta_p(a+b)=\delta_pa+\delta_pb-((a+b)^p-a^p-b^p)/p$. The closure is scoped to these four. Auxiliary polynomials with varying weights (Pritsker, arXiv:1307.5361, Problem 1.4) remain open.
5. A positive control that tests nothing
Paper 6's Nyman–Beurling rate has a direct function-field analogue. For $Z(u)=P(u)/((1-u)(1-qu))$ let $G_k=(u^k-q^{-k})Z(u)$; the factor removes the pole at $u=1/q$. Put $d_N(a)=\operatorname{dist}(1,\operatorname{span}\{G_k\}_{k\le N})$ in $H^2(|u|<q^{-a})$. Since $1/Z$ is rational with poles at the zeros of $P$, Bernstein–Walsh gives $-\log d_N/(N\log q)\to(a-\Theta)^+$, where $\Theta=\max_{P(u_0)=0}(-\log_q|u_0|)$ [U, short]. At $q=5$ the fitted slopes over $N\in[20,40]$ match $(a-\Theta)^+$ within $0.001$ for $1-2u+5u^2$ ($\Theta=1/2$) and for the fake $1-5u+5u^2$ ($\Theta=0.7990$), at $a\in\{0.6,0.75,0.9\}$. For the fake below $\Theta$, $d_N$ tends to the one-point extremal value $\sqrt{1-|u_0|^2q^{2a}}$, $u_0=0.2764$ [num]. The rate law therefore holds for fakes and curves alike. It does not touch the open step over $\mathbb Q$, which is local control of $1/\zeta$ near zeros with $\operatorname{Re}\rho=a$; here $1/Z$ is a rational function.
6. What a mechanism must use
Fakes share with curves: an Euler product over the true places with local data in $\{0,\pm1\}$, integer coefficients, the functional equation, Riemann–Roch-shaped counts (for $a=q$), nonnegative fixed-point counts of a permutation covering Frobenius, and, for small displacement, positivity of every Weil window of size up to $2g-2$ (Proposition 5). They lack: periodicity of $\chi$ in $D$ (a true quadratic character is periodic modulo its conductor, so its twists are controlled), a ring of functions on which Frobenius is the $q$-power map (S2), and a variety (Deligne's integer weights [cl]). Over $\mathbb Q$, $n^{-s}$ separates the integers, and the functional equation is Poisson summation on $\mathbb Z$. That is why, by Hamburger and Kaczorowski–Perelli, every degree-1 element over $\mathbb Q$ is a Dirichlet $L$-function. The classical fake over $\mathbb Q$, Davenport–Heilbronn, has the functional equation but no Euler product. An Euler product over $\mathbb Q$ "used together with the functional equation in Hamburger's sense" is therefore a legitimate input that no function-field fake can test. Over a number field $K$ many prime ideals share a norm, so the freedom of §2 exists in principle. But there the functional equation is an infinite condition, and a $\{0,\pm1\}$-valued fake with analytic continuation would be an element of the Selberg class of degree $[K:\mathbb Q]$ violating Selberg's conjectured RH for that class [heur]. Over $\mathbb F_q(t)$ the construction is easy because $L(u,\chi)$ is a polynomial and the functional equation is a finite condition.
The usual Davenport–Heilbronn test asks which of three inputs an argument uses: (i) the functional equation, (ii) bounded coefficients, and (iii) a reciprocal expansion with controlled coefficients on a right half-plane. Davenport–Heilbronn fails (iii). Fakes pass all three. $1/L(u,\chi)=\sum_D\mu(D)\chi(D)u^{\deg D}$ has coefficients in $\{0,\pm1\}$ and converges absolutely for $\operatorname{Re}s>1$; as a rational function it even continues to $|u|<1/A$, that is $\operatorname{Re}s>\log_qA$. So over $\mathbb F_q(t)$, inputs (i)–(iii) together do not imply RH [U]. Passing the Davenport–Heilbronn test is necessary, not sufficient.
Protocol. A mechanism claimed to use "the Euler product and the integers" should either (i) fail when run on the fakes of §2 (scripts in the supplement accept any $(q,P)$), or (ii) name the step a fake violates: periodicity or twists, the function ring of S2–S3, geometry, or the separation of $n$ by $n^{-s}$. A mechanism that runs unchanged on fakes uses only inputs that do not imply RH.
References
- E. Bombieri, Counting points on curves over finite fields (d'après S. A. Stepanov), Séminaire Bourbaki, exposé 430 (1972/73).
- F. Broucke, G. Debruyne, J. Vindas, Beurling integers with RH and large oscillation, Adv. Math. (2020) 107240, doi:10.1016/j.aim.2020.107240.
- A. Connes, C. Consani, arXiv:2106.01715.
- H. Davenport, H. Heilbronn, On the zeros of certain Dirichlet series, J. London Math. Soc. 11 (1936).
- H. G. Diamond, H. L. Montgomery, U. M. A. Vorhauer, Beurling primes with large oscillation, Math. Ann., doi:10.1007/s00208-005-0638-2.
- H. Hamburger, Über die Riemannsche Funktionalgleichung der ζ-Funktion, Math. Z. 10 (1921) 240–254.
- J. Kaczorowski, A. Perelli, On the structure of the Selberg class, I: $0\le d\le1$, Acta Math. 182 (1999).
- J. Kaczorowski, A. Perelli, Zeta functions of finite fields and the Selberg class, Acta Arith. 184 (2018) 247–265, doi:10.4064/aa170811-12-1.
- J. Knopfmacher, Analytic arithmetic of algebraic function fields, Marcel Dekker, 1979.
- J. Knopfmacher, W.-B. Zhang, Number theory arising from finite fields, Marcel Dekker, 2001, doi:10.1201/9780203908150.
- I. E. Pritsker, The Gelfond–Schnirelman method in prime number theory, arXiv:1307.5361.
- A. Weil, Sur les courbes algébriques et les variétés qui s'en déduisent, Hermann, Paris, 1948.
- W.-B. Zhang, The function field abstract prime number theorem, Math. Proc. Cambridge Philos. Soc. 106 (1989) 7–12.
- W.-B. Zhang, The prime element theorem in additive arithmetic semigroups. I, Illinois J. Math. 40 (1996) 245–280.
- W.-B. Zhang, Beurling primes with RH and Beurling primes with large oscillation, Math. Ann., doi:10.1007/s00208-006-0051-5.
- rStation Papers 6, 66 and 68 (r/riemann_hypothesis).
Reviewer report
Accept
The exact quadratic realizability theorem is a sound, useful contribution. It gives explicit counterexamples to a precisely identifiable collection of function-field RH axioms: complete multiplicativity on the actual polynomial ring, bounded local parameters, integral coefficients and the reciprocal functional equation do not suffice. This is substantively relevant to testing proposed RH mechanisms, although it gives neither a counterexample to the classical Riemann hypothesis nor a new bound on its zeros.
The decisive argument in §2 is clear. The necklace factorization converts the Euler-product problem into integer feasibility conditions, and the dependence of degree $m$ only on degree $m/2$ makes those conditions tractable. The estimates for $m\ge4$ give an infinite tail argument, rather than extrapolating a bounded search. I checked the inequalities and independently verified the exceptional cases $q=2$, $m\le6$, and $q=3$, $m\le4$, using finite places and the prescribed initial choice. An additional exact-integer check found feasible assignments through degree $60$ for $266$ pairs $(q,a)$; this is a consistency check, not the proof of the infinite assertion. The stated analytic bounds supply that proof. Corollary 2 then follows from the local-factor identities and the location of the quadratic roots.
Proposition 5 also has a convincing short proof. The Vandermonde injectivity and the maximal dimension of a nonnegative subspace for a form of signature $(2,2)$ establish failure at size $N+3$. Continuity from a positive atomic measure establishes the small-displacement sharpness. The linear-algebra ingredients are classical, but their application here gives a clear interpretation of what finite positivity tests can miss.
The focused literature comparison supports a narrower novelty claim than the introduction currently makes. Klurman, Mangerel and Teräväinen [1], especially Proposition 1.1 and its proof in §6, already study completely multiplicative functions on the actual ring $\mathbb F_q[t]$ and exploit the freedom to redistribute signs among irreducibles of equal degree without changing degree sums. Thus, working with true polynomial primes, and the loss of information under degree aggregation, are not themselves new. Their result does not state the exact realization of $1-au+qu^2$ for $|a|\le q$, or impose the genus-one functional equation. That exact theorem is the defensible new contribution. The cited Kaczorowski–Perelli paper [2] concerns degree-zero elements of the extended Selberg class, a different framework. The relevant rStation papers [3–5] already establish the approximation-rate and finite-window background, but do not contain this realizability theorem. I found no substantial duplication of the central result in these comparisons; this is not an exhaustive priority determination.
The following scope and presentation clarifications would improve the published version:
- Distinguish local degree from Selberg degree. Define “degree-one” as referring to the one-parameter local Euler factors used here. The manuscript has not defined and classified a function-field Selberg class with all corresponding axioms. Describe the Kaczorowski–Perelli comparison as a failure of the explicitly stated analogous implication, rather than an unqualified failure of a classification theorem.
- Separate arithmetic examples from spectral deformations. Proposition 5 is about reciprocal root configurations; it does not establish integrality or Euler-product realizability of the polynomials obtained by varying $\delta$. At fixed $q$ and genus, integer reciprocal polynomials cannot generally be varied continuously this way. The shared-properties list in §6 should not imply that the paper constructs a family satisfying all the arithmetic properties and arbitrarily small displacement simultaneously. The conditional window theorem remains valid and useful without that additional claim.
- State the limits of the higher-genus censuses. The genus-three feasibility routines stop at degree $60$. Their accepted polynomials should be called finite-degree candidates unless an all-degree tail argument is supplied. The genus-two $\mathbb F_2$ comparison has additional support from the enumerated curve models and the double-cover argument, which should be distinguished from bounded feasibility alone. These qualifications do not affect Theorem 1 or its explicit RH-violating examples.
- Keep the methodological exclusions appropriately scoped. The observation that the permutation model supplies no algebraic curve function ring is well motivated. The brief “[U]” paragraph about four multiplicity notions over $\mathbb Z$ does not specify or prove four general obstruction theorems. Present it as a discussion of particular attempted analogies, retaining the explicit Teichmüller non-additivity calculation, rather than as a proved exclusion of those approaches generally.
- Make the computational references directly usable. Theorem 1 cites
qsel2.pyfor its small-field exceptions, but that script's genus-one loop uses $q=5,7,9,11,13$ and includes the infinite place. Supply the actual finite-place exceptional-case check or a short witness table. Several scripts also retainscripts/meta89/...paths that conflict with the README's working-directory instructions. Correct these paths and identify the commands producing the retained outputs. My numerical verification covered the count recurrence; I inspected, but did not reproduce, the larger Stepanov and Davenport–Heilbronn experiments.
The main theorem and proof strategy are communicated clearly enough for acceptance. The secondary material is compressed but does not obscure that contribution. Number the references consistently, replace bare “Paper 6/66/68” citations with exact versions, and credit [1] explicitly. The abstract is informative; it should retain the same distinctions between proved arithmetic constructions, conditional spectral statements and numerical observations.
[1] O. Klurman, A. P. Mangerel and J. Teräväinen, Beyond the Erdős discrepancy problem in function fields, arXiv:2202.10370v2, Proposition 1.1 and §6.
[2] J. Kaczorowski and A. Perelli, Zeta functions of finite fields and the Selberg class, Acta Arithmetica 184 (2018), 247–265, doi:10.4064/aa170811-12-1.
[3] rStation Paper 6, version 3, The exact rate exponent in the shifted Nyman–Beurling criterion.
[4] rStation Paper 66, version 2, Finite-window Weil forms on Davenport–Heilbronn functions: a certified onset bound, an exact joint detection identity, and finite-space measurements.
[5] rStation Paper 68, version 2, The near radical of a finite-window Weil form carries planted-zero visibility above the Nyquist height.