Special FunctionsReading edition

Arithmetic inverse and character resolution

Reading tools
Reading libraryInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Other resources

Original TeX with line links

Skip contents and start reading

The function encodes its parameters

The complete exact analytic germ determines

\[ \boxed{a,\quad\beta,\quad\operatorname{rad}(Q).} \]

Precisely, two admissible triples define the same germ if and only if these three quantities agree. Prime powers in \(Q\) are invisible because the terms use only coprimality. A finite Taylor polynomial or noisy measurements are different inputs from the complete germ in this theorem.

Let the support integers be \(n_1<n_2<\cdots\), frequencies \(\lambda_j=-2\log(1-n_j^{-\beta})\), and weights \(w_j=n_j^{-2a}\). Starting at \(R_1=A\), peel the ordered atoms:

\[ \lambda_j=\lim_{t\to\infty}\frac{\log R_j(-t)}t,\qquad w_j=\lim_{t\to\infty}e^{-\lambda_jt}R_j(-t), \]
\[ R_{j+1}(s)=R_j(s)-w_je^{-\lambda_js}. \]

Every limit follows from the isolated largest remaining frequency and the positive summable tail. Thus the exact function determines its spectral list.

The counting law \(N_Q(x)=\delta_Qx+O_Q(\sqrt x)\) gives

\[ \lambda_j=2\delta_Q^\beta j^{-\beta} [1+O_{Q,\beta}(j^{-1/2}+j^{-\beta})], \quad \beta=-\lim_{j\to\infty}\frac{\log\lambda_j}{\log j}. \]

Once \(\beta\) is recovered,

\[ n_j=(1-e^{-\lambda_j/2})^{-1/\beta},\qquad a=-\frac{\log w_j}{2\log n_j}. \]

Prime membership in this integer support then recovers the excluded prime set. The reconstruction is exact from infinite data; it does not certify that a finite search has found every excluded prime.

Classical Laplace uniqueness provides a comparison for the inverse mechanism. The parameter-specific extraction, frequency-rank law, and explicit instability are proved locally in the complete arithmetic route.

Separation improves while subtraction worsens

The frequency-rank estimates converge toward the depth exponent. Later-atom peeling at large negative depth also has a rapidly growing subtraction condition factor. These are finite examples from the checked arithmetic run, not certified floating-point intervals.
The frequency-rank estimates converge toward the depth exponent. Later-atom peeling at large negative depth also has a rapidly growing subtraction condition factor. These are finite examples from the checked arithmetic run, not certified floating-point intervals.

View full-size figure (new tab)

If earlier atoms have been removed exactly, set \(\Delta_j=\lambda_j-\lambda_{j+1}>0\), \(M_{j+1}=\sum_{k>j}w_k\). The logarithmic secant

\[ \widehat\lambda_j(t,h)=\frac{\log R_j(-t-h)-\log R_j(-t)}h \]

obeys, for \(t\ge0\), \(h>0\),

\[ 0\le\lambda_j-\widehat\lambda_j(t,h) \le\frac1h\log\left(1+\frac{M_{j+1}}{w_j}e^{-\Delta_jt}\right). \]

This improves with negative depth. But relative error in \(A(-t)\) can be amplified after subtraction by

\[ \kappa_j(t)=\frac{A(-t)}{R_j(-t)} \sim\frac{w_1}{w_j}e^{(\lambda_1-\lambda_j)t}. \]

For the displayed \(Q=1\) example, the third-atom subtraction at \(t=500\) has a condition factor of roughly \(10^{108.8}\). Exact uniqueness therefore does not promise easy recovery from ordinary precision.

A large prime can hide in every finite window

For a prime \(p\nmid Q\), any \(R\ge0\), and integer \(k\ge0\),

\[ \boxed{\sup_{|s|\le R}|A_{a,\beta,Q}^{(k)}(s)-A_{a,\beta,Qp}^{(k)}(s)| \le\lambda_p^k e^{R\lambda_p}\frac{Z_Q(2a)}{p^{2a}+1}.} \]

The difference consists of the \(p\)-divisible admissible squarefree atoms. Their frequencies are at most \(\lambda_p\) and their total weight is the Euler-factor expression on the right. Termwise differentiation proves the bound for every derivative.

The proved compact-window envelope shrinks as the excluded prime increases. At a= β =2, Q=1, R=5, excluding p=10007 changes the entire window by at most approximately 1.0749 times 10 -16 . The depth-zero difference is known exactly.
The proved compact-window envelope shrinks as the excluded prime increases. At \(a=\beta=2\), \(Q=1\), \(R=5\), excluding \(p=10007\) changes the entire window by at most approximately \(1.0749\times10^{-16}\). The depth-zero difference is known exactly.

View full-size figure (new tab)

The radical differs for every such prime, while all bounded-window derivatives converge to those of \(A_Q\). Without a bound on excluded primes, there is no uniformly stable inverse from these windows to the radical parameter.

The same distinction appears in weak taps: exact structural invariants can change under perturbations that are small at finite resolution.

An infinite feature space with arithmetic labels

For the ordered support, define \(\phi_s(j)=\sqrt{w_j}e^{-\lambda_js}\). The kernel \(A(s+\overline t)\) is its weighted \(\ell^2\) Gram kernel. Summability and bounded frequencies make every feature vector well defined.

If a weighted \(\ell^2\) combination produces the zero entire function, Cauchy–Schwarz makes its coefficients absolutely summable. Successive dominant-frequency peeling then forces every coefficient to vanish. This gives an injective Hilbert realization, and all finite derivative Hankel matrices have full rank: a nonzero polynomial in \(\lambda\) cannot vanish on the infinite frequency support.

Fixed-modulus character resolution

For characters \(\chi,\psi\) modulo a fixed \(Q\), let \(\eta=\chi\overline\psi\). When \(\eta\) is nonprincipal, the elementary squarefree character sum is \(O_Q(\sqrt x)\), with no density term. The same sector partial-integration argument therefore gives

\[ A_{\chi,\psi}(s) =O_{a,\beta,Q,\epsilon}(|s|^{-(2a-1/2)/\beta}), \qquad |\arg s|\le\pi/2-\epsilon. \]

Compared with the principal \(|s|^{-(2a-1)/\beta}\) scale, this is faster by \(|s|^{-1/(2\beta)}\). The modulus is fixed; the constants are not asserted uniform as \(Q\) grows. Individual off-diagonal functions can be complex and are not asserted completely monotone.

Source and conversion record

This HTML edition follows the retained manuscript. It adds no proof review or Lean coverage.

Source identities and equation checks

Notation in Special Functions

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index