Skip to content

Borel–Padé Computation and High-Precision Spectral Tests

Exact WKB becomes computational only after several analytic choices have already been made. A finite list of WKB coefficients is not a Borel sum; a rational function fitted to that list is not the exact Borel transform; and a small determinant residual is not a certified eigenvalue. The numerical task is to preserve those distinctions while turning the declared exact-WKB passport into reproducible numbers.

This page builds that workflow around two exact laboratories. The regularized Weber path isolates the Borel–Padé problem because its Borel-pole lattice, positive-ray sum, and lateral jump are known in closed form. The PT-symmetric Airy box isolates the spectral problem because its exact determinant can be compared with an unrelated arbitrary-precision Taylor shooting calculation. Together they test the two halves of the workflow without pretending to be one end-to-end spectral calculation or a general convergence theorem. In particular, the Airy roots are not produced from the Weber Borel data.

Finite coefficients do not yet define a sum

Section titled “Finite coefficients do not yet define a sum”

Four objects that are often called “the Borel transform” must be kept separate:

LayerObjectWhat is known
Formal tailf^a0\widehat f-a_0Coefficients generated algebraically
Borel germBf^\mathcal B\widehat f near ξ=0\xi=0A finite Taylor list, or an actual convergent germ under a Gevrey bound
Rational continuationRL,M=PL/QMR_{L,M}=P_L/Q_MA finite Padé approximation fixed by coefficient matching
Directional valuea0+LθRL,Ma_0+\mathcal L_\theta R_{L,M}A numerical approximation to a declared Borel sum

The final spectrum adds two further layers: resummed symbols must be inserted into the complete boundary determinant, and the zeros of that determinant must be counted and refined. Skipping a layer can produce a beautifully converged answer to a different problem.

The evidence vocabulary from Chapter 4’s verified-numerics page is useful here:

  • computed means that one finite prescription returned a value;
  • internally converged means that controlled refinements agree;
  • cross-verified means that a representation with different failure modes agrees;
  • certified means that the relevant value, integral, or zero lies in a proved enclosure; and
  • physically validated additionally checks the boundary and sheet interpretation.

Borel–Padé calculations with arbitrary precision commonly reach the first three levels. They reach certification only when the continuation, quadrature, and zero-count errors have genuine bounds.

Implement the shifted transform exactly once

Section titled “Implement the shifted transform exactly once”

Page 1 fixed the normalization

f^()=a0+n1ann,Bf^(ξ)=j0aj+1j!ξj.\widehat f(\hbar) = a_0+\sum_{n\geq1}a_n\hbar^n, \qquad \mathcal B\widehat f(\xi) = \sum_{j\geq0} \frac{a_{j+1}}{j!}\xi^j.

Given N+1N+1 Borel coefficients b0,,bNb_0,\ldots,b_N, choose L+M=NL+M=N and write

PL(ξ)=r=0Lprξr,QM(ξ)=1+s=1Mqsξs.\begin{aligned} P_L(\xi) &= \sum_{r=0}^{L}p_r\xi^r, \\ Q_M(\xi) &= 1+\sum_{s=1}^{M}q_s\xi^s. \end{aligned}

The [L/M][L/M] Padé approximant is defined by

QM(ξ)n=0NbnξnPL(ξ)=O(ξN+1).Q_M(\xi) \sum_{n=0}^{N}b_n\xi^n - P_L(\xi) = O(\xi^{N+1}).

The denominator coefficients solve the square system

s=1Mqsbns=bn,n=L+1,,L+M,\sum_{s=1}^{M} q_s b_{n-s} = -b_n, \qquad n=L+1,\ldots,L+M,

where coefficients with negative indices are zero. The numerator then follows from

pn=s=0min(M,n)qsbns,q0=1.p_n = \sum_{s=0}^{\min(M,n)} q_s b_{n-s}, \qquad q_0=1.

This calculation should be done exactly when the input coefficients are exact rationals. For numerical input it should be repeated at guard precision. A singular system is a defective Padé type, not an invitation to hide the problem with an unreported least-squares solve.

Quantum periods have two different factorial shifts

Section titled “Quantum periods have two different factorial shifts”

For an even-\hbar quantum period,

Π^γ=Πγ,0+k1Πγ,2k2k,\widehat\Pi_\gamma = \Pi_{\gamma,0} + \sum_{k\geq1} \Pi_{\gamma,2k}\hbar^{2k},

the period tail and the quantum part of the Voros exponent are

Π^γΠγ,0=k1Πγ,2k2k,V^γq=Π^γΠγ,0=k1Πγ,2k2k1.\begin{aligned} \widehat\Pi_\gamma-\Pi_{\gamma,0} &= \sum_{k\geq1} \Pi_{\gamma,2k}\hbar^{2k}, \\ \widehat V_\gamma^{\mathrm q} &= \frac{ \widehat\Pi_\gamma-\Pi_{\gamma,0} }{\hbar} = \sum_{k\geq1} \Pi_{\gamma,2k}\hbar^{2k-1}. \end{aligned}

Their shifted Borel transforms are therefore

B(Π^γΠγ,0)=k1Πγ,2kξ2k1(2k1)!,BV^γq=k1Πγ,2kξ2k2(2k2)!.\begin{aligned} \mathcal B \left( \widehat\Pi_\gamma-\Pi_{\gamma,0} \right) &= \sum_{k\geq1} \Pi_{\gamma,2k} \frac{\xi^{2k-1}}{(2k-1)!}, \\ \mathcal B\widehat V_\gamma^{\mathrm q} &= \sum_{k\geq1} \Pi_{\gamma,2k} \frac{\xi^{2k-2}}{(2k-2)!}. \end{aligned}

Using the first transform in place of the second produces

Bwrong(ξ)=1ξ0ξBV^γq(s) ⁣ds.\mathcal B_{\mathrm{wrong}}(\xi) = \frac{1}{\xi} \int_0^\xi \mathcal B\widehat V_\gamma^{\mathrm q}(s) \,\dd s.

The Laplace inverse still reconstructs the power 2k1\hbar^{2k-1}, but divides its coefficient by 2k12k-1.

Four implementation rules prevent the most expensive mistakes:

  1. Factor exp(Zγ/)\exp(Z_\gamma/\hbar) before applying the ordinary Borel transform.
  2. Retain the zero odd or even coefficients in a generic series. A substitution such as u=ξ2u=\xi^2 is safe only when parity is proved.
  3. Generate coefficients exactly or at their true working precision. Promoting binary64 inputs to 100 digits restores no information.
  4. Rescale ξ=Ascaleu\xi=A_{\mathrm{scale}}u when a known nearest action is far from unit scale, and record that scale with the output.

A Padé table is an audit, not a decoration

Section titled “A Padé table is an audit, not a decoration”

One diagonal approximant cannot reveal whether its apparent poles are stable. At fixed coefficient order, inspect several near-diagonal shapes, for example

LM{2,1,0,1,2},L+MN.L-M\in\{-2,-1,0,1,2\}, \qquad L+M\leq N.

Repeat the table as NN and the arithmetic precision increase. The pole and zero maps then have three common signatures:

Observed patternPlausible interpretationRequired check
An isolated pole and residue stabilizeMeromorphic Borel singularityVary NN, shape, precision, and scaling
Alternating pole–zero strings stabilize collectivelyRational approximation to a branch cutCompare the whole string, not individual poles
A close pole–zero pair moves rapidlyFroissart doublet or coefficient noiseTrack it across the full Padé table

A convenient scale-invariant doublet diagnostic for a denominator pole p0p\neq0 is

dF(p):=minPL(z)=0pzmax(p,z).d_{\mathrm F}(p) := \min_{P_L(z)=0} \frac{|p-z|}{\max(|p|,|z|)}.

A denominator zero cannot occur at p=0p=0 because QM(0)=1Q_M(0)=1, and this ratio is unchanged by a common nonzero rescaling of the Borel coordinate. Flagging a small dFd_{\mathrm F} is useful; silently cancelling the pair is not. Cancellation can change the analytic dependence on EE and invalidate a later argument-principle calculation.

Withheld-coefficient prediction provides another independent axis. Construct RL,MR_{L,M} without the last few known coefficients, re-expand it, and compare the predictions with the withheld values. Good prediction does not prove global continuation, but bad prediction is an immediate failure.

General Padé convergence theorems have hypotheses. Stahl-type results, for example, concern convergence in capacity for specified multivalued analytic functions. They do not guarantee uniform convergence along an arbitrary Laplace ray for every resurgent germ.

For a pole-free ray ξ=eiϕt\xi=\ee^{\ii\phi}t, the shifted Borel–Padé approximation is

Sϕ[L/M]f^()=a0+eiϕ0exp ⁣(eiϕt)RL,M(eiϕt) ⁣dt.\mathcal S_{\phi}^{[L/M]}\widehat f(\hbar) = a_0 + \ee^{\ii\phi} \int_0^\infty \exp\!\left( -\frac{\ee^{\ii\phi}t}{\hbar} \right) R_{L,M}(\ee^{\ii\phi}t) \,\dd t.

There is no factor 1/1/\hbar. If the continued Borel transform obeys an upper bound proportional to exp(κt)\exp(\kappa t) along the ray, absolute convergence follows from the sufficient condition

σ:=Re(eiϕ)>κ.\sigma := \operatorname{Re} \left( \frac{\ee^{\ii\phi}}{\hbar} \right) > \kappa.

For a singular central direction θ0\theta_0, this chapter uses

θ+=θ0+δ,θ=θ0δ,δ>0,\theta_+ = \theta_0+\delta, \qquad \theta_- = \theta_0-\delta, \qquad \delta>0,

and

Discθ0=Sθ0+Sθ0.\operatorname{Disc}_{\theta_0} = \mathcal S_{\theta_0+} - \mathcal S_{\theta_0-}.

A fixed offset represents the intended lateral homotopy class only if the rotated ray can be deformed to that lateral contour without crossing another singularity. Varying δ\delta tests numerical clearance from Padé poles; it does not replace the homotopy argument.

Tail error and continuation error are different quantities

Section titled “Tail error and continuation error are different quantities”

Suppose that for tTt\geq T,

RL,M(eiϕt)C(1+t)peκt,τ:=σκ>0.\left| R_{L,M}(\ee^{\ii\phi}t) \right| \leq C(1+t)^p\ee^{\kappa t}, \qquad \tau:=\sigma-\kappa>0.

Then the omitted tail is bounded by

Teeiϕt/RL,M(eiϕt) ⁣dtCTeτt(1+t)p ⁣dt=Ceττp1Γ ⁣(p+1,τ(1+T)).\begin{aligned} \left| \int_T^\infty \ee^{-\ee^{\ii\phi}t/\hbar} R_{L,M}(\ee^{\ii\phi}t) \,\dd t \right| &\leq C\int_T^\infty \ee^{-\tau t}(1+t)^p \,\dd t \\ &= C\ee^\tau \tau^{-p-1} \Gamma\!\left( p+1,\tau(1+T) \right). \end{aligned}

This controls the tail of the rational approximation. It says nothing about the difference between that rational function and the exact continued Borel transform. If an independent bound

Bf^(eiϕt)RL,M(eiϕt)ε(t)\left| \mathcal B\widehat f(\ee^{\ii\phi}t) - R_{L,M}(\ee^{\ii\phi}t) \right| \leq \varepsilon(t)

is available, integrate ε(t)\varepsilon(t) against the same Laplace kernel. Without it, Padé-order stability remains evidence rather than an enclosure.

A principal-value integral is not a substitute for two lateral sums. Likewise, a median resummation is fixed by the transseries and Stokes automorphism of Page 7; it is not generically the arithmetic mean of two numerical laterals.

Weber exposes the whole Borel–Padé mechanism

Section titled “Weber exposes the whole Borel–Padé mechanism”

Page 5 introduced the regularized Weber exponent

W^W()=k1(212k1)B2k2k(2k1)μ2k12k1.\widehat W_{\mathrm W}(\hbar) = \sum_{k\geq1} \frac{ \left(2^{1-2k}-1\right)B_{2k} }{ 2k(2k-1)\mu^{2k-1} } \hbar^{2k-1}.

Its shifted Borel transform is known exactly:

BW^W(ξ)=12ξ[csch(ξ2μ)2μξ].\mathcal B\widehat W_{\mathrm W}(\xi) = \frac{1}{2\xi} \left[ \operatorname{csch} \left( \frac{\xi}{2\mu} \right) - \frac{2\mu}{\xi} \right].

The origin is removable. The nonzero poles and residues are

ξk=2πiμk,Resξ=ξkBW^W=(1)k2πik,kZ{0}.\begin{aligned} \xi_k &= 2\pi\ii\mu k, \\ \operatorname*{Res}_{\xi=\xi_k} \mathcal B\widehat W_{\mathrm W} &= \frac{(-1)^k}{2\pi\ii k}, \qquad k\in\mathbb Z\setminus\{0\}. \end{aligned}

Because this Borel transform is provably even, set u=ξ2u=\xi^2 and use

GK(u)=r=0K1crur,cr=(22r11)B2r+2(2r+2)!μ2r+1.G_K(u) = \sum_{r=0}^{K-1}c_ru^r, \qquad c_r = \frac{ \left(2^{-2r-1}-1\right)B_{2r+2} }{ (2r+2)!\,\mu^{2r+1} }.

Choose

L=K12,M=K12,L = \left\lceil\frac{K-1}{2}\right\rceil, \qquad M = \left\lfloor\frac{K-1}{2}\right\rfloor,

construct PL(u)/QM(u)P_L(u)/Q_M(u) exactly, and evaluate

RK(ξ)=PL(ξ2)QM(ξ2).R_K(\xi) = \frac{P_L(\xi^2)}{Q_M(\xi^2)}.

The parity reduction is specific to this audited symmetry. Applying it to a generic Borel germ can identify the +ξ+\xi and ξ-\xi directions incorrectly.

The nonsingular ray tests continuation and quadrature

Section titled “The nonsingular ray tests continuation and quadrature”

Take

μ=1,=0.2,t=μ=5.\mu=1, \qquad \hbar=0.2, \qquad t=\frac{\mu}{\hbar}=5.

The exact positive-ray sum should be evaluated in logarithmic form:

Wexact=t+logΓ ⁣(t+12)12log(2π)tlogt.W_{\mathrm{exact}} = t + \log\Gamma\!\left(t+\frac12\right) - \frac12\log(2\pi) - t\log t.

Numerically,

Wexact=0.008314127756458320906725546713964838938099753.W_{\mathrm{exact}} = -0.008314127756458320906725546713964838938099753 \ldots.

With 80-decimal arithmetic, exact Bernoulli input, and split high-precision quadrature, the companion checker obtains

KKPadé type in uuAbsolute error
4[2/1][2/1]2.8490×10122.8490\times10^{-12}
8[4/3][4/3]1.4897×10211.4897\times10^{-21}
12[6/5][6/5]1.2273×10301.2273\times10^{-30}
20[10/9][10/9]1.1536×10481.1536\times10^{-48}

The table is unusually clean because the target is meromorphic and exactly known. It calibrates the code; it does not promise the same rate for a Borel transform with cuts or several competing actions.

Now set

=i,θ0=π2,θ±=π2±0.1.\hbar=\ii, \qquad \theta_0=\frac{\pi}{2}, \qquad \theta_\pm=\frac{\pi}{2}\pm0.1.

Both rotated Laplace kernels decay because

Re(eiθ±i)=cos(0.1)>0.\operatorname{Re} \left( \frac{\ee^{\ii\theta_\pm}}{\ii} \right) = \cos(0.1)>0.

The closest point on either rotated ray to ξk=2πik\xi_k=2\pi\ii k occurs at t=2πkcos(0.1)t=2\pi k\cos(0.1). The implementation splits at the nearby action scales t=2πkt=2\pi k; these breakpoints resolve the narrow features without being claimed as the exact projections. The resulting difference is

Sθ0+W^WSθ0W^W=log ⁣(1+e2π)=0.00186570122829807564414623197325513.\begin{aligned} \mathcal S_{\theta_0+}\widehat W_{\mathrm W} - \mathcal S_{\theta_0-}\widehat W_{\mathrm W} &= \log\!\left(1+\ee^{-2\pi}\right) \\ &= 0.00186570122829807564414623197325513 \ldots. \end{aligned}

The K=8K=8 and K=16K=16 Padé calculations miss this value by 2.34×10102.34\times10^{-10} and 6.86×10186.86\times10^{-18}, respectively. The positive sign is therefore checked simultaneously by the Borel residues, the rotated quadrature, and Page 5’s DDP convention.

The Weber Borel pole lattice and convergence of its positive-ray Borel–Padé sum.

Borel–Padé continuation must be audited in both the Borel plane and the final observable. Left: open circles are the exact Weber poles ξk=2πiμk\xi_k=2\pi\ii\mu k; filled symbols schematically overlay the computed K=16K=16 Padé poles, whose first three absolute displacements are approximately 3.73×10233.73\times10^{-23}, 6.42×10136.42\times10^{-13}, and 2.91×1072.91\times10^{-7} at the plot’s scale. The positive and lateral Laplace rays remain explicit. Right: comparison with the exact gamma-function expression shows nearly linear growth of benchmark-correct digits with the number KK of nonzero coefficients in this meromorphic calibration.

Resummed exponents must enter the complete determinant

Section titled “Resummed exponents must enter the complete determinant”

For each required cycle or relative path, restore the classical action only after summing the quantum correction:

Vγ,ϕBP=exp ⁣[Zγ+SϕBPV^γq].\mathcal V_{\gamma,\phi}^{\mathrm{BP}} = \exp\!\left[ \frac{Z_\gamma}{\hbar} + \mathcal S_\phi^{\mathrm{BP}} \widehat V_\gamma^{\mathrm q} \right].

Then insert all symbols into the chamber-correct route product from Page 6. A single period equation detached from its endpoint lines is not a boundary determinant. When the Stokes graph changes, transform every symbol, path, and endpoint line together.

The raw exponentials can overflow or underflow long before the determinant loses information. Work with logarithmic symbols and scaled endpoint frames. If the canonical columns are rescaled by analytic nonzero functions,

cLfL(E)cL,cRfR(E)cR,c_L\longmapsto f_L(E)c_L, \qquad c_R\longmapsto f_R(E)c_R,

then

D(E)=det(cL,cR)fL(E)fR(E)D(E).D(E) = \det(c_L,c_R) \longmapsto f_L(E)f_R(E)D(E).

The zero divisor and its multiplicities are unchanged. Record the scale factors anyway: values of two differently normalized determinants cannot be compared pointwise without them.

A phase-unwrapped logarithmic quantization condition is useful for initial guesses. Final roots should solve a single-valued determinant. Changing a numerical branch of logVγ\log\mathcal V_\gamma can otherwise look like changing the quantum number.

Let D(E)D(E) be holomorphic inside and nonzero on a positively oriented contour CC. The argument principle and its moments give

sk:=12πiCEkDE(E)D(E) ⁣dE=jmjEjk.s_k := \frac{1}{2\pi\ii} \oint_C E^k\frac{D_E(E)}{D(E)} \,\dd E = \sum_j m_jE_j^k.

In particular, s0s_0 counts enclosed zeros with multiplicity. If the chosen characteristic function is meromorphic, the same integral counts zeros minus poles; known normalization poles must be removed or counted explicitly.

A derivative-free first pass samples DD at ordered contour nodes:

Nh=12πjArg(D(Ej+1)D(Ej)).N_h = \frac{1}{2\pi} \sum_j \operatorname{Arg} \left( \frac{D(E_{j+1})}{D(E_j)} \right).

Insert midpoints whenever an image segment approaches the origin or a phase increment becomes large. Then double the node count and compare with a separate quadrature of DE/DD_E/D. An integer-looking phase sum is not certified unless nonvanishing on the whole contour and evaluation errors are controlled.

For two enclosed zeros and no poles,

c=s12,d2=s22c2,E±=c±d.c=\frac{s_1}{2}, \qquad d^2=\frac{s_2}{2}-c^2, \qquad E_\pm=c\pm d.

The moments give root guesses without independent Newton seeds. They also show why s0=2s_0=2 cannot distinguish two close simple roots from one double root: at a double root d2=0d^2=0, but one must additionally check

D=0,DE=0,DEE0.D=0, \qquad D_E=0, \qquad D_{EE}\neq0.

Along a simple spectral branch depending on λ\lambda,

 ⁣dE ⁣dλ=DλDE.\frac{\dd E}{\dd\lambda} = - \frac{D_\lambda}{D_E}.

Use this as a predictor and correct with the single-valued determinant. When DE|D_E| collapses, stop simple-root tracking and solve the augmented system D=DE=0D=D_E=0 or change to a Puiseux or pseudo-arclength parameter.

If a computable approximation D~\widetilde D obeys

supCDD~<infCD~,\sup_C|D-\widetilde D| < \inf_C|\widetilde D|,

Rouché’s theorem transfers the zero count. Chapter 4 develops the corresponding Rouché and Krawczyk enclosures; this page uses the argument principle as a high-precision diagnostic rather than claiming an interval proof.

The Airy box supplies an independent spectral audit

Section titled “The Airy box supplies an independent spectral audit”

Return to Page 8’s problem

ψ+igxψ=Eψ,ψ(1)=ψ(1)=0.-\psi''+\ii gx\psi=E\psi, \qquad \psi(-1)=\psi(1)=0.

With

α=g1/3eiπ/6,z±=α(±1+iEg),\alpha=g^{1/3}\ee^{\ii\pi/6}, \qquad z_\pm = \alpha \left( \pm1+\frac{\ii E}{g} \right),

the raw and PT-real-normalized determinants are

DA(E,g)=Ai(z)Bi(z+)Ai(z+)Bi(z),ΔA(E,g)=eiπ/6DA(E,g).\begin{aligned} D_{\mathrm A}(E,g) &= \operatorname{Ai}(z_-)\operatorname{Bi}(z_+) - \operatorname{Ai}(z_+)\operatorname{Bi}(z_-), \\ \Delta_{\mathrm A}(E,g) &= \ee^{-\ii\pi/6}D_{\mathrm A}(E,g). \end{aligned}

Special-function evaluation alone is not an independent check. Instead, shoot the ODE from

y(1)=0,y(1)=1,y(-1)=0, \qquad y'(-1)=1,

and define F(E,g)=y(1)F(E,g)=y(1). Around a Taylor center x0x_0, write

y(x0+s)=n0cnsn.y(x_0+s) = \sum_{n\geq0}c_ns^n.

The differential equation gives the exact recurrence

cn+2=(igx0E)cn+igcn1(n+2)(n+1),c1=0.c_{n+2} = \frac{ (\ii gx_0-E)c_n+\ii g c_{n-1} }{ (n+2)(n+1) }, \qquad c_{-1}=0.

Marching this recurrence over several equal subintervals uses only polynomial arithmetic at arbitrary precision. It shares neither Airy special-function algorithms nor a finite-difference eigensolver with ΔA\Delta_{\mathrm A}.

The Airy Wronskian is

Ai(z)Bi(z)Ai(z)Bi(z)=1π.\operatorname{Ai}(z)\operatorname{Bi}'(z) - \operatorname{Ai}'(z)\operatorname{Bi}(z) = \frac1\pi.

Consequently,

y(x)=πα[Ai(z)Bi(z(x))Bi(z)Ai(z(x))]y(x) = \frac{\pi}{\alpha} \left[ \operatorname{Ai}(z_-)\operatorname{Bi}(z(x)) - \operatorname{Bi}(z_-)\operatorname{Ai}(z(x)) \right]

has the declared initial data, and hence

F(E,g)=παDA(E,g)=πg1/3ΔA(E,g).F(E,g) = \frac{\pi}{\alpha}D_{\mathrm A}(E,g) = \frac{\pi}{g^{1/3}}\Delta_{\mathrm A}(E,g).

This zero-free normalization identity checks the Airy determinant’s phase as well as its zero set.

At g=10g=10, 75-decimal arithmetic, eight Taylor steps, and order 60 give

QuantityHigh-precision value or result
First zero4.5784904182916919656037944.578490418291691965603794\ldots
Second zero8.9966832557123482084373308.996683255712348208437330\ldots
Airy versus Taylor-shooting rootsAgreement better than 2×10582\times10^{-58}; a second Taylor grid agrees beyond 105410^{-54}
Rectangle 3ReE103\leq\operatorname{Re}E\leq10, $\operatorname{Im}E
Minimum sampled $\Delta_{\mathrm A}

The mutually agreeing numerical counts are consistent with exactly the two displayed roots in the box. The largest adjacent phase increments fall from 0.0923962160.092396216\ldots to 0.0462116560.046211656\ldots when the edge mesh is doubled. The sampled clearance is a useful safety diagnostic, but not a lower bound between samples.

Near the first exceptional point,

gc=12.31245567226052505295708367,Ec=7.108599596764948797243418965,\begin{aligned} g_c &= 12.31245567226052505295708367\ldots, \\ E_c &= 7.108599596764948797243418965\ldots, \end{aligned}

the count remains two while DED_E tends to zero. Ordinary Newton conditioning therefore deteriorates even though the contour count is stable. The augmented equations and the nonzero derivatives DEED_{EE} and DgD_g distinguish the double zero from two numerically unresolved simple zeros.

A refinement tensor exposes the error floor

Section titled “A refinement tensor exposes the error floor”

Record the numerical prescription as a tuple rather than a single “precision”:

R=(K,L,M,pwork,ϕ,δ,T,εquad,εroot,nx,Nx).\mathfrak R = \left( K,L,M,p_{\mathrm{work}}, \phi,\delta,T, \varepsilon_{\mathrm{quad}}, \varepsilon_{\mathrm{root}}, n_x,N_x \right).

Here KK is the coefficient count, pworkp_{\mathrm{work}} the arithmetic precision, (nx,Nx)(n_x,N_x) the number and order of Taylor steps, and the remaining entries describe the rational approximation, contour, quadrature, and root solve.

Refinement axisPrimary failure mode exposed
KKInsufficient formal or Borel information
L,ML,MDependence on rational-continuation shape
pworkp_{\mathrm{work}}Padé-system conditioning and roundoff
ϕ,δ\phi,\deltaWrong ray, lateral class, or poor pole clearance
T,εquadT,\varepsilon_{\mathrm{quad}}Tail truncation and quadrature
Root tolerance and contour nodesMissed roots or incomplete polishing
nx,Nxn_x,N_x or match pointIndependent ODE propagation error

Vary one axis at a time. If every entry is changed simultaneously, an improved result gives no information about which error was dominant.

At a fixed spectral parameter EE, the schematic determinant-evaluation decomposition

DD~=(DDK,L,MBP)+(DK,L,MBPDquad)+(DquadDfl)\begin{aligned} D-\widetilde D ={}& \left(D-D_{K,L,M}^{\mathrm{BP}}\right) \\ &+ \left( D_{K,L,M}^{\mathrm{BP}} - D^{\mathrm{quad}} \right) \\ &+ \left( D^{\mathrm{quad}} - D^{\mathrm{fl}} \right) \end{aligned}

separates continuation error, quadrature error, and finite-arithmetic determinant-evaluation error. The last two can often be bounded. The first has no universal estimator and must not be hidden inside a tiny quadrature tolerance.

Root error is a separate local question. If EE_* is a simple zero, E^\widehat E is the polished approximate zero, the determinant error is bounded by εD\varepsilon_D on a neighborhood UU, and DED_E stays away from zero there, then the first-order estimate is

E^EDfl(E^)+εDinfEUDE(E).|\widehat E-E_*| \lesssim \frac{ |D^{\mathrm{fl}}(\widehat E)|+\varepsilon_D }{ \inf_{E\in U}|D_E(E)| }.

This estimate becomes ineffective near a multiple zero, exactly where the exceptional-point calculation finds DE0D_E\to0.

Every published value should carry a reproduction manifest:

  1. software and version;
  2. coefficient provenance and Borel normalization;
  3. cycle, branch, chamber, and phase of \hbar;
  4. K,L,MK,L,M and any Borel-variable scaling;
  5. Laplace angle, lateral offset, interval splitting, and tail rule;
  6. working precision and guard digits;
  7. determinant normalization and spectral sheet;
  8. root-count contour and refinement;
  9. the complete stability table; and
  10. an independent comparison target.

The companion script borel-pade-spectral-check.py uses exact SymPy rational arithmetic for the Weber Padé systems and mpmath for 75–80 decimal quadrature, special functions, Taylor propagation, and root refinement. It performs the same checks under ordinary Python and optimized Python because every failure raises an explicit exception.

The script prints:

  • Python, SymPy, and mpmath versions;
  • the Weber coefficient count and Padé shape;
  • convergence to the exact gamma-function sum;
  • the first Padé poles and the lateral jump;
  • both Airy roots from independent determinants;
  • the 80/160-node windings, phase-increment audit, independent DE/DD_E/D quadrature, and sampled contour clearance; and
  • a limitation statement separating cross-verification from certification.

Its two laboratories are intentionally independent. Weber tests the Borel machinery without a spectral root finder. Airy tests the spectral machinery without depending on Padé continuation. These are two half-pipeline calibrations; a new exact-WKB problem must pass both classes of audit in the same end-to-end calculation.

Mixing Borel conventions. The shifted transform used here has no 1/1/\hbar in the inverse Laplace integral. Test a single monomial before comparing code or formulas from another convention.

Trusting one diagonal approximant. A stable printed value can hide a moving pole near the integration ray. Inspect nearby Padé shapes, pole maps, withheld coefficients, and precision dependence.

Deleting every close pole–zero pair. Some pairs are numerical Froissart defects, while stable alternating pairs can encode a branch cut. Report and track them before changing the rational function.

Calling a principal value a median sum. A principal value is an integration prescription. A median resummation also includes the transseries and Stokes data needed for ambiguity cancellation.

Polishing roots before counting them. Newton iteration finds the root selected by its seed and can return the same root twice. Count zeros on a contour first, then polish enough roots to account for the count.

Equating many digits with a proof. Increasing arithmetic precision reduces roundoff but does not supply missing analytic continuation, tail, or contour bounds.

Starting from

QM(ξ)n=0L+MbnξnPL(ξ)=O(ξL+M+1),Q_M(\xi) \sum_{n=0}^{L+M}b_n\xi^n - P_L(\xi) = O(\xi^{L+M+1}),

derive the equations for q1,,qMq_1,\ldots,q_M and p0,,pLp_0,\ldots,p_L. Explain what a singular denominator system means.

Solution

The coefficient of ξn\xi^n in the product is

s=0min(M,n)qsbns,q0=1.\sum_{s=0}^{\min(M,n)} q_s b_{n-s}, \qquad q_0=1.

For 0nL0\leq n\leq L, this coefficient must equal pnp_n. For L+1nL+ML+1\leq n\leq L+M, the numerator has no such coefficient, so

s=1Mqsbns=bn.\sum_{s=1}^{M} q_s b_{n-s} = -b_n.

These last MM equations determine the denominator; the first L+1L+1 then determine the numerator. A singular system means that the requested Padé type is defective or nonunique for this coefficient list. One must change the type or analyze the degeneracy, not silently substitute an unreported least-squares answer.

Let

V^q=k1Π2k2k1.\widehat V^{\mathrm q} = \sum_{k\geq1} \Pi_{2k}\hbar^{2k-1}.

Derive its shifted Borel transform. What series is reconstructed if (2k1)!(2k-1)! is used instead of (2k2)!(2k-2)!?

Solution

The monomial n\hbar^n maps to ξn1/(n1)!\xi^{n-1}/(n-1)!. With n=2k1n=2k-1,

BV^q=k1Π2kξ2k2(2k2)!.\mathcal B\widehat V^{\mathrm q} = \sum_{k\geq1} \Pi_{2k} \frac{\xi^{2k-2}}{(2k-2)!}.

If one instead uses (2k1)!(2k-1)!, termwise Laplace inversion gives

eξ/ξ2k2(2k1)! ⁣dξ=2k12k1.\int \ee^{-\xi/\hbar} \frac{\xi^{2k-2}}{(2k-1)!} \,\dd\xi = \frac{\hbar^{2k-1}}{2k-1}.

The reconstructed coefficient is divided by 2k12k-1. Equivalently,

Bwrong(ξ)=1ξ0ξBcorrect(s) ⁣ds,\mathcal B_{\mathrm{wrong}}(\xi) = \frac{1}{\xi} \int_0^\xi \mathcal B_{\mathrm{correct}}(s) \,\dd s,

with the value at ξ=0\xi=0 supplied by analytic continuation.

3. Use parity without losing a Borel direction

Section titled “3. Use parity without losing a Borel direction”

Show that the Weber Borel transform is even and derive the coefficients crc_r of G(u)G(u) with u=ξ2u=\xi^2. Why is the same substitution unsafe for a generic exact-WKB series?

Solution

Only powers 2k1\hbar^{2k-1} occur in W^W\widehat W_{\mathrm W}. The shifted transform lowers each exponent by one, so only ξ2k2\xi^{2k-2} occur. Setting r=k1r=k-1 gives

cr=(22r11)B2r+2(2r+2)!μ2r+1.c_r = \frac{ \left(2^{-2r-1}-1\right)B_{2r+2} }{ (2r+2)!\,\mu^{2r+1} }.

Thus BW^W(ξ)=G(ξ2)\mathcal B\widehat W_{\mathrm W}(\xi)=G(\xi^2). A generic Borel transform contains both even and odd powers, and singularities at +ξ+\xi_* and ξ-\xi_* can carry different continuation data. Replacing ξ\xi by ξ2\xi^2 without an actual symmetry collapses those two directions.

At μ=1\mu=1 and =i\hbar=\ii, use the Weber residues to calculate

Sπ/2+W^WSπ/2W^W.\mathcal S_{\pi/2+}\widehat W_{\mathrm W} - \mathcal S_{\pi/2-}\widehat W_{\mathrm W}.
Solution

The positive imaginary poles are ξk=2πik\xi_k=2\pi\ii k. Their Laplace weights are

exp ⁣(ξki)=e2πk.\exp\!\left(-\frac{\xi_k}{\ii}\right) = \ee^{-2\pi k}.

Page 2’s upper-minus-lower convention contributes 2πi-2\pi\ii times each residue. Since

Resξ=ξkBW^W=(1)k2πik,\operatorname*{Res}_{\xi=\xi_k} \mathcal B\widehat W_{\mathrm W} = \frac{(-1)^k}{2\pi\ii k},

the discontinuity is

k1(1)k+1ke2πk=log ⁣(1+e2π)>0.\begin{aligned} \sum_{k\geq1} \frac{(-1)^{k+1}}{k}\ee^{-2\pi k} &= \log\!\left(1+\ee^{-2\pi}\right) \\ &> 0. \end{aligned}

The sign is tied to the declared lateral ordering and cannot be inferred from the magnitude of the jump alone.

Prove the tail bound in the text from

R(eiϕt)C(1+t)peκt.|R(\ee^{\ii\phi}t)| \leq C(1+t)^p\ee^{\kappa t}.
Solution

The Laplace kernel contributes at most eσt\ee^{-\sigma t}, with σ=Re(eiϕ/)\sigma=\operatorname{Re}(\ee^{\ii\phi}/\hbar). Set τ=σκ>0\tau=\sigma-\kappa>0. Then

tailCTeτt(1+t)p ⁣dt.\left|\text{tail}\right| \leq C\int_T^\infty \ee^{-\tau t}(1+t)^p\,\dd t.

With u=1+tu=1+t and then v=τuv=\tau u,

Teτt(1+t)p ⁣dt=eτ1+Teτuup ⁣du=eττp1Γ ⁣(p+1,τ(1+T)).\begin{aligned} \int_T^\infty \ee^{-\tau t}(1+t)^p\,\dd t &= \ee^\tau \int_{1+T}^\infty \ee^{-\tau u}u^p\,\dd u \\ &= \ee^\tau\tau^{-p-1} \Gamma\!\left( p+1,\tau(1+T) \right). \end{aligned}

This proves the displayed result. It bounds the chosen rational integrand, not the unknown Padé modeling error.

A denominator pole pNp_N and numerator zero zNz_N satisfy dF(pN)1d_{\mathrm F}(p_N)\ll1. Give a refinement test that distinguishes a likely Froissart doublet from a pole–zero chain representing a cut.

Solution

Track (pN,zN)(p_N,z_N) while varying NN, several nearby Padé shapes, the working precision, and the Borel scaling. A likely Froissart pair moves rapidly, changes separation when the arithmetic precision changes, and has negligible influence on the Laplace sum away from it. A cut is represented collectively: an alternating string of poles and zeros settles onto a stable arc or ray as NN grows, even though no individual finite pole is the branch cut.

Neither signature justifies automatic deletion. For a spectral determinant, any cancellation must also be analytic in EE throughout the root-count region.

Let D=det(cL,cR)D=\det(c_L,c_R) and rescale the endpoint columns by analytic nonzero functions fLf_L and fRf_R. Show that every zero and its multiplicity is preserved.

Solution

Multilinearity gives

D~(E)=det(fLcL,fRcR)=fL(E)fR(E)D(E).\widetilde D(E) = \det(f_Lc_L,f_Rc_R) = f_L(E)f_R(E)D(E).

At a zero EE_*, write

D(E)=(EE)mh(E),h(E)0.D(E) = (E-E_*)^m h(E), \qquad h(E_*)\neq0.

Then

D~(E)=(EE)m[fL(E)fR(E)h(E)],\widetilde D(E) = (E-E_*)^m \left[ f_L(E)f_R(E)h(E) \right],

and the bracket is nonzero at EE_*. The multiplicity mm is unchanged. This fails if either scale factor vanishes or has a pole there.

Assume CC encloses exactly two simple zeros E1,E2E_1,E_2 and no poles. Express the roots using s0,s1,s2s_0,s_1,s_2. What changes at a double zero?

Solution

The moments are

s0=2,s1=E1+E2,s2=E12+E22.s_0=2, \qquad s_1=E_1+E_2, \qquad s_2=E_1^2+E_2^2.

Set

c=s12,d2=s22c2.c=\frac{s_1}{2}, \qquad d^2=\frac{s_2}{2}-c^2.

Since

d2=(E1E2)24,d^2 = \frac{(E_1-E_2)^2}{4},

the roots are c±dc\pm d. At a double zero, d=0d=0 and the moment data return the repeated root cc. The moments alone do not prove defectiveness; one must audit DED_E, the operator pencil, and the geometric multiplicity.

Derive the Taylor recurrence for

y+igxy=Ey-y''+\ii gxy=Ey

about x0x_0, and prove

F(E,g)=πg1/3ΔA(E,g).F(E,g) = \frac{\pi}{g^{1/3}}\Delta_{\mathrm A}(E,g).
Solution

Write x=x0+sx=x_0+s and y=n0cnsny=\sum_{n\geq0}c_ns^n. Matching the coefficient of sns^n in

y=(igxE)yy'' = (\ii gx-E)y

gives

(n+2)(n+1)cn+2=(igx0E)cn+igcn1,(n+2)(n+1)c_{n+2} = (\ii gx_0-E)c_n + \ii g c_{n-1},

with c1=0c_{-1}=0. This is the stated recurrence.

Let z(x)=α(x+iE/g)z(x)=\alpha(x+\ii E/g) with α=g1/3eiπ/6\alpha=g^{1/3}\ee^{\ii\pi/6}. The solution

y(x)=πα[Ai(z)Bi(z(x))Bi(z)Ai(z(x))]y(x) = \frac{\pi}{\alpha} \left[ \operatorname{Ai}(z_-)\operatorname{Bi}(z(x)) - \operatorname{Bi}(z_-)\operatorname{Ai}(z(x)) \right]

vanishes at x=1x=-1. Differentiating and using W[Ai,Bi]=1/πW[\operatorname{Ai},\operatorname{Bi}]=1/\pi gives y(1)=1y'(-1)=1. Evaluating at x=1x=1 yields

F(E,g)=παDA(E,g)=πg1/3eiπ/6DA(E,g),F(E,g) = \frac{\pi}{\alpha}D_{\mathrm A}(E,g) = \frac{\pi}{g^{1/3}} \ee^{-\ii\pi/6}D_{\mathrm A}(E,g),

which is the desired identity. Its prefactor is nonzero for g>0g>0, so the shooting and Airy determinants have the same zeros and multiplicities.

Run the companion checker in ordinary and optimized Python. Reproduce the four Weber errors, the first three Padé poles, both lateral-jump errors, the two Airy roots, the 80/160-node winding counts, and the DE/DD_E/D count. Then repeat the Airy root calculation with Taylor grids (nx,Nx)=(8,60)(n_x,N_x)=(8,60) and (10,56)(10,56). Classify each conclusion as computed, internally converged, cross-verified, or certified.

Solution

The commands are

Terminal window
python3 public/code/advanced-ode/borel-pade-spectral-check.py
python3 -O public/code/advanced-ode/borel-pade-spectral-check.py

A minimal manifest records Python, SymPy, and mpmath versions together with μ=1\mu=1, =0.2\hbar=0.2 or i\ii, g=10g=10, 75–80 working digits, every [L/M][L/M] shape, the offsets 0.10.1 and 0.120.12, both Taylor grids, and both contour meshes. The nonsingular Weber errors should be

| KK | Padé shape | WKWexact|W_K-W_{\mathrm{exact}}| | |---:|---:|---:| | 44 | [2/1][2/1] | 2.8490×10122.8490\times10^{-12} | | 88 | [4/3][4/3] | 1.4897×10211.4897\times10^{-21} | | 1212 | [6/5][6/5] | 1.2273×10301.2273\times10^{-30} | | 2020 | [10/9][10/9] | 1.1536×10481.1536\times10^{-48} |

For the lateral jump, K=8K=8 and 1616 give errors 2.34×10102.34\times10^{-10} and 6.86×10186.86\times10^{-18}. The first three positive Padé poles approach 2πi2\pi\ii, 4πi4\pi\ii, and 6πi6\pi\ii. The Airy roots begin

E0=4.578490418291691965603794,E1=8.996683255712348208437330.\begin{aligned} E_0 &=4.578490418291691965603794\ldots, \\ E_1 &=8.996683255712348208437330\ldots. \end{aligned}

Both Taylor grids agree with the Airy determinant to the declared tolerances. Both sampled windings and the independent logarithmic- derivative quadrature return 22. These results are internally converged and cross-verified. They are not certified because no interval enclosures control the Padé modeling error, special functions, Taylor remainder, or contour nonvanishing between nodes.

11. Design an end-to-end modified-Mathieu test

Section titled “11. Design an end-to-end modified-Mathieu test”

For

2ψ(x)+2qcos(2x)ψ(x)=Eψ(x),ψ(x+π)=eiπνψ(x),-\hbar^2\psi''(x) +2q\cos(2x)\psi(x) = E\psi(x), \qquad \psi(x+\pi)=\ee^{\ii\pi\nu}\psi(x),

design a calculation that starts from formal WKB periods, constructs directional Borel–Padé sums, assembles a Bloch determinant, and checks its zeros independently. State the passport and the failure tests; a numerical implementation is a research extension.

Solution

A defensible protocol has six stages.

  1. Fix real or complex (q,,ν)(q,\hbar,\nu), the branch of p(x)=E2qcos2xp(x)=\sqrt{E-2q\cos2x}, an A/BA/B homology basis on the double cover, and the turning-point/Stokes chamber.

  2. Generate the regularized quantum periods to order KK, apply the shifted Borel transform only to their quantum tails, and construct a near-diagonal Padé table. Track poles, zeros, residues, withheld coefficients, precision, and changes of Borel scale.

  3. Choose nonsingular or lateral Laplace rays compatible with arg\arg\hbar. Record every deformation and restore the classical factors exp(Zγ/)\exp(Z_\gamma/\hbar) before forming Voros symbols.

  4. Derive the chamber-correct monodromy matrix M(E)M(E) from those symbols and use

    Dν(E)=trM(E)2cos(πν)D_\nu(E) = \operatorname{tr}M(E)-2\cos(\pi\nu)

    as the Bloch characteristic function. This step, including all Stokes factors and normalizations, is the missing bridge that the two calibrations on this page intentionally do not supply.

  5. Count zeros of DνD_\nu by adaptive phase sampling and DE/DD_E/D quadrature before polishing them. Repeat the full refinement tensor, especially across any Stokes-wall crossing.

  6. Cross-check with a method having different failure modes: truncate the Fourier/Hill matrix for the Mathieu operator or propagate a fundamental matrix over one period and impose trM=2cos(πν)\operatorname{tr}M=2\cos(\pi\nu). Increase the Fourier cutoff or ODE precision independently.

Agreement of the two spectra is strong evidence only after the same sheet, Bloch phase, and determinant normalization have been verified. A mismatch should first trigger audits of the cycle orientation, lateral sign, missing Stokes multiplier, and classical exponential—not more root-polishing digits.

Quantum periods are ready for a second interpretation

Section titled “Quantum periods are ready for a second interpretation”

Chapter 9 ends with an ODE object whose cycle, regularization, Stokes chamber, Borel direction, determinant normalization, and numerical error record are explicit. Chapter 10 asks when such a resummed quantum period can also be identified with a Seiberg–Witten period or an Nekrasov–Shatashvili quantity.

Numerical agreement does not establish that dictionary. The next chapter must still fix the classical Seiberg–Witten curve and differential, A/BA/B-cycle normalization, operator ordering, polarization, mass shifts, quantum mirror map, and ϵ1=\epsilon_1=\hbar convention. It must also distinguish all-orders NS data from a nonperturbative spectral completion.