Special FunctionsReading edition

Prime sieves and signed measures

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

Prime sieves and signed measures

An infinite prime shelf changes the packets

For a prime \(p\) and \(\lambda\ge-1\), let

\[ x_n=(1-n^{-2})^2,\qquad \nu_{p,\lambda}=\sum_{n\ge1}\mu(n)^2n^{-4} (1+\lambda\mathbf1_{p\mid n})\delta_{x_n}. \]

Define monic orthogonal polynomials \(P_m^{(k;p,\lambda)}\) for the measure \(x^k{\,d}\nu_{p,\lambda}\), \(k\ge0\) integer. The zero atom has mass one at \(k=0\) and is annihilated when \(k\ge1\).

Left: degree-two packets for p=2, depth zero. Right: initial atom masses. Strength -1 deletes every even squarefree atom; strength 0 is the original measure; strength 1 doubles that shelf.
Left: degree-two packets for \(p=2\), depth zero. Right: initial atom masses. Strength \(-1\) deletes every even squarefree atom; strength \(0\) is the original measure; strength \(1\) doubles that shelf.

View full-size figure (new tab)

The exact moments are finite zeta stencils:

\[ M_j^{p,\lambda}=\sum_{r=0}^{2j}(-1)^r\binom{2j}{r} \frac{\zeta(4+2r)}{\zeta(8+4r)} \left(1+\frac{\lambda}{p^{4+2r}+1}\right). \]

All polynomial coefficients belong to \(\mathbb Q(\pi^{-2},\lambda)\). With \(\Delta=M_0M_2-M_1^2\),

\[ P_1=x-\frac{M_1}{M_0},\qquad P_2=x^2-\frac{M_0M_3-M_1M_2}{\Delta}x+ \frac{M_1M_3-M_2^2}{\Delta}. \]

The infinitely many positive nodes make every Hankel matrix strictly positive definite throughout \(\lambda\ge-1\). Hence all degrees exist, with positive norms, real simple zeros in \((0,1)\), and interlacing.

Finite positivity can conceal a signed defect

Let \(\nu_{\mathrm{non}p}\) and \(\nu_p\) be the restrictions of the undeformed measure \(\nu_{p,0}\) to indices not divisible by \(p\) and divisible by \(p\), respectively. Then \(\nu_{p,\lambda}=\nu_{\mathrm{non}p}+(1+\lambda)\nu_p\). Let \(A_m,B_m\) be the order-\(m\) Hankel matrices of these two unscaled positive measures. Both are positive definite. Thus

\[ \tau_m(\lambda)=\det(A_m+(1+\lambda)B_m) =\det A_m\prod_{i=1}^{m}[1+(1+\lambda)\eta_i], \]

where \(\eta_i>0\) are the eigenvalues of \(A_m^{-1/2}B_mA_m^{-1/2}\). Every determinant root is real and below \(-1\); possible coefficient poles occur there, although numerator cancellation is possible.

The line is a proved bound for p=2; dots are ordinary high-precision pencil roots. A defect lambda =-1.001 eventually violates positivity even though it can pass low-order checks.
The line is a proved bound for \(p=2\); dots are ordinary high-precision pencil roots. A defect \(\lambda=-1.001\) eventually violates positivity even though it can pass low-order checks.

View full-size figure (new tab)

The nearest root is \(-1-\delta_m\), with

\[ \delta_m=\min_{\substack{f\in\mathbb R[x]\setminus\{0\}\\\deg f<m}} \frac{\int f^2{\,d}\nu_{\mathrm{non}p}}{\int f^2{\,d}\nu_p}>0, \qquad\delta_m\downarrow0. \]

To prove the limit, approximate a continuous bump supported at the isolated node \(x_p\) by polynomials on \([0,1]\). The numerator tends to zero while the denominator retains the \(p^{-4}\) atom. Hence every \(\lambda<-1\) eventually produces a negative finite-degree quadratic form.

For \(p=2\), test with \(f(x)=x(1-x)^{m-2}\), \(m\ge2\):

\[ \delta_m\le\frac{4096}{81}\left(\frac{16M_0}{17}-1\right) \left(\frac{272}{567}\right)^{2(m-2)},\qquad M_0=105\pi^{-4}. \]

This follows from \(x_2=9/16\) and \(x_n\ge64/81\) at nonzero odd nodes. Exactly \(\delta_1=p^4\); the limit is an infinite-resolution phenomenon.

Classical operations with arithmetic coordinates

The depth tilt \(x^k\) is a Christoffel transformation. Suppressing \(p,\lambda\),

\[ P_m^{(k+1)}(x)=\frac{P_{m+1}^{(k)}(x) -[P_{m+1}^{(k)}(0)/P_m^{(k)}(0)]P_m^{(k)}(x)}{x}. \]

The numerator vanishes at zero. All roots are positive, so the displayed denominator coefficient is nonzero. For shifted Hankel determinants \(\tau_m^{(k)}=\det[M_{k+i+j}]_{i,j<m}\), with \(\tau_0^{(k)}=1\),

\[ \tau_m^{(k)}\tau_m^{(k+2)}-(\tau_m^{(k+1)})^2 =\tau_{m+1}^{(k)}\tau_{m-1}^{(k+2)}>0,\qquad m\ge1. \]

This is the Desnanot–Jacobi identity applied to exact arithmetic moments. The construction mechanism is classical.

An endpoint mass is numerically delicate

For the undeformed depth-zero measure, set \(\nu_\theta=\nu+\theta\delta_0\), \(\theta\ge-1\). Write \(h_j=\int P_j(x)^2{\,d}\nu(x)\) and \(K_m(x,y)=\sum_{j=0}^{m}P_j(x)P_j(y)/h_j\). The Uvarov formula [Uvarov1969] is

\[ P_m^{[\theta]}(x)=P_m(x)- \frac{\theta P_m(0)}{1+\theta K_{m-1}(0,0)}K_{m-1}(x,0), \]

with \(K_{-1}=0\) for degree zero. The mass at zero is recovered by

\[ 1\le\frac1{K_m(0,0)}\le1+(M_0-1)(7/16)^{2m}. \]

The lower bound comes from the zero atom, whose mass is one. The test polynomial \((1-x)^m\) gives the upper bound since every other node is at least \(9/16\). At finite degree \(K_m(0,0)<1\), because no nonzero polynomial can vanish at all the other infinitely many nodes. Complete mass removal is valid, while \(1-K_m(0,0)\) becomes very small. This explains the conditioning problem.

The resolvent is non-D-finite

For \(\lambda\ge-1\), the Stieltjes function \(S_{p,\lambda}(z)=\int(z-x)^{-1}{\,d}\nu_{p,\lambda}(x)\) has infinitely many isolated poles at the positive-weight nodes \(x_n\to1\). A solution of a finite rational-coefficient linear ODE has only finitely many possible finite singular points. The germ at \(z=2\) therefore is not D-finite. This is a general infinite-atomic-resolvent mechanism, specialized here to arithmetic data.

The full packet sequence also cannot be an affine copy of a continuous Jacobi sequence: compact moment determinacy would equate a purely atomic measure with a continuous one. An inherited Laguerre scaling limit remains compatible with this separation of the complete families.

Multiple-prime geometry

Part III: Orbit spectra and exact coordinates

Spectral continuation and the coefficient language of polyphase transforms.

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