Mertens products in arithmetic progressions over function fields
arXiv:2602.05788
Abstract
We prove a function field analogue of Mertens' formula for Euler products over prime polynomials in arithmetic progressions in , the counterpart of a formula of Languasco and Zaccagnini over the integers. An elementary argument shows that the product over the prime polynomials of degree at most equals , where is the -th harmonic number, up to an exponentially small relative error. Combined with the unconditional Riemann hypothesis for Dirichlet -functions, this gives the main result: the product over a reduced residue class is an explicit Euler-product constant times a power of the normalizing function , the exponent being the reciprocal of the number of reduced classes, again with an exponentially small error and uniformly for all moduli of degree at most . It is , and not the naive analogue of under , that is the right normalization; substituting the latter turns the formula into an expansion in powers of whose leading coefficients we compute, the leading correction being combinatorial rather than arithmetic.
12 pages. v2: substantially revised. Corrects the main theorem of v1, which omitted a secondary term of size 1/(2 Phi(Q) n) in the normalization (n log q)^{-1/Phi(Q)}