Processing math: 65%

Zeta functions

Note

A bit on encodings and basic operations

Field algebra

Let S be the space/statespace/system

(maybe with parts/states/aspects s0,s1,s2,s3,s4,)

traceless part

S1+T1t

or similar … here 1 is the neutral/constant thing in the theory and T resp. t is what's really interesting about S.

E.g. you have a scattering matrix and 1 is the free propagation and T is the interaction.

Q

1S … flipped encoding, switches low and far behavior, represents the weight of X.

Q(t):=11t=n=0tn

It starts out as Q(t)=1+t+O(t2)1T, but it diverges once t reaches 1.

(And I observe SQ(t)=2Q(t)1.)

log

log(S)=log(1+T)=n=0(1)nnTn

… logarithmic encoding, alternating+declining coefficients give very good convergence.

We want to understand this, in a broad sense, as tamed version of the original: log(T)<T.

But, for Q(t) interpreted in a field, its proper singularity isn't tamed by log:

log(Q(t))=log(11t)=log(1t)=n=01ntn

still diverges at lim.

zeta

\zeta_S … Some gluing together of data of S.

Sometimes zetas are somewhat obscured using \exp's chained with \log's, in the spirit of above.

Product

\Pi is a gluing together of some aspects of a system.

It's a convolution (in the literal and the metaphorical sense) of structure (e.g addition for polynomials and multiplication for Dirichlet-like objects such as the Riemann zeta function)

Riemann zeta

For primes p, set t_z=p^{-z} and define

\zeta_\text{Riemann}(z):=\prod Q(t_z)=\prod_\text{primes p}\frac{1}{1-p^{-z}}.

Polylog

See Polylogarithm:

\log\left(\dfrac{1}{1-t}\right)={\mathrm{Li}}_1(t)

\zeta_\text{Riemann}(z)={\mathrm{Li}}_s(1)

Reference

Wikipedia: Local zeta-function, Weil conjectures # Statement of the Weil conjectures

StackExchange: What is a zeta function? (Great answer!)


Riemann zeta function