Is There a Way to Regularize Euler Products on Primes?

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 3K views
mhill
Messages
180
Reaction score
1
although is not valid in general (since an Euler product usually converges only when Re(s) >1)

[tex]\frac{ d \zeta(1/2)}{\zeta (1/2)}= -\sum_{p} log(p)(1-p^{1/2}[/tex]
 
Physics news on Phys.org
Well, this is simply by taking logarithms on either side of the Euler product representation to get,

[tex]\log{\zeta(s)} = -\sum_{p} \log{(1 - p^{-s})}[/tex]

where [itex]p[/tex] is the set of primes.<br /> Differentiating then gives,<br /> <br /> [tex]\frac{\zeta'(s)}{\zeta(s)} = -\sum_{p} (p^{s} - 1)^{-1} \log{p}[/tex]<br /> <br /> This gives the zeta-regularized sum (and hence product) on primes (which looks curious as it is, unless special values of [itex]s[/tex] are used), but generally its more convenient to consider,<br /> <br /> [tex]\prod_{n} \lambda_{n} = \exp{-\zeta_{\lambda}'(0)}[/tex]<br /> <br /> for a zeta function defined on a sequence [itex](\lambda_{n})_{n \geq 1}[/tex].<br /> <br /> If its a prime regularization you're after, look for this paper by Munoz Garcia and Perez Marco called 'Super Regularization of Infinite Products'.<br /> <br /> Never mind, here's the link to the preprint pdf-<br /> http://inc.web.ihes.fr/prepub/PREPRINTS/M03/M03-52.pdf[/itex][/itex][/itex]
 
Last edited by a moderator: