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:
| Layer | Object | What is known |
|---|---|---|
| Formal tail | Coefficients generated algebraically | |
| Borel germ | near | A finite Taylor list, or an actual convergent germ under a Gevrey bound |
| Rational continuation | A finite Padé approximation fixed by coefficient matching | |
| Directional value | 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
Given Borel coefficients , choose and write
The Padé approximant is defined by
The denominator coefficients solve the square system
where coefficients with negative indices are zero. The numerator then follows from
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- quantum period,
the period tail and the quantum part of the Voros exponent are
Their shifted Borel transforms are therefore
Using the first transform in place of the second produces
The Laplace inverse still reconstructs the power , but divides its coefficient by .
Four implementation rules prevent the most expensive mistakes:
- Factor before applying the ordinary Borel transform.
- Retain the zero odd or even coefficients in a generic series. A substitution such as is safe only when parity is proved.
- Generate coefficients exactly or at their true working precision. Promoting binary64 inputs to 100 digits restores no information.
- Rescale 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
Repeat the table as and the arithmetic precision increase. The pole and zero maps then have three common signatures:
| Observed pattern | Plausible interpretation | Required check |
|---|---|---|
| An isolated pole and residue stabilize | Meromorphic Borel singularity | Vary , shape, precision, and scaling |
| Alternating pole–zero strings stabilize collectively | Rational approximation to a branch cut | Compare the whole string, not individual poles |
| A close pole–zero pair moves rapidly | Froissart doublet or coefficient noise | Track it across the full Padé table |
A convenient scale-invariant doublet diagnostic for a denominator pole is
A denominator zero cannot occur at because , and this ratio is unchanged by a common nonzero rescaling of the Borel coordinate. Flagging a small is useful; silently cancelling the pair is not. Cancellation can change the analytic dependence on and invalidate a later argument-principle calculation.
Withheld-coefficient prediction provides another independent axis. Construct 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.
The Laplace contour is part of the answer
Section titled “The Laplace contour is part of the answer”For a pole-free ray , the shifted Borel–Padé approximation is
There is no factor . If the continued Borel transform obeys an upper bound proportional to along the ray, absolute convergence follows from the sufficient condition
For a singular central direction , this chapter uses
and
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 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 ,
Then the omitted tail is bounded by
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
is available, integrate 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
Its shifted Borel transform is known exactly:
The origin is removable. The nonzero poles and residues are
Because this Borel transform is provably even, set and use
Choose
construct exactly, and evaluate
The parity reduction is specific to this audited symmetry. Applying it to a generic Borel germ can identify the and directions incorrectly.
The nonsingular ray tests continuation and quadrature
Section titled “The nonsingular ray tests continuation and quadrature”Take
The exact positive-ray sum should be evaluated in logarithmic form:
Numerically,
With 80-decimal arithmetic, exact Bernoulli input, and split high-precision quadrature, the companion checker obtains
| Padé type in | Absolute error | |
|---|---|---|
| 4 | ||
| 8 | ||
| 12 | ||
| 20 |
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.
Rotated rays fix the lateral sign
Section titled “Rotated rays fix the lateral sign”Now set
Both rotated Laplace kernels decay because
The closest point on either rotated ray to occurs at . The implementation splits at the nearby action scales ; these breakpoints resolve the narrow features without being claimed as the exact projections. The resulting difference is
The and Padé calculations miss this value by and , respectively. The positive sign is therefore checked simultaneously by the Borel residues, the rotated quadrature, and Page 5’s DDP convention.
Borel–Padé continuation must be audited in both the Borel plane and the final observable. Left: open circles are the exact Weber poles ; filled symbols schematically overlay the computed Padé poles, whose first three absolute displacements are approximately , , and 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 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:
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,
then
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 can otherwise look like changing the quantum number.
Count roots before polishing them
Section titled “Count roots before polishing them”Let be holomorphic inside and nonzero on a positively oriented contour . The argument principle and its moments give
In particular, 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 at ordered contour nodes:
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 . 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,
The moments give root guesses without independent Newton seeds. They also show why cannot distinguish two close simple roots from one double root: at a double root , but one must additionally check
Along a simple spectral branch depending on ,
Use this as a predictor and correct with the single-valued determinant. When collapses, stop simple-root tracking and solve the augmented system or change to a Puiseux or pseudo-arclength parameter.
If a computable approximation obeys
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
With
the raw and PT-real-normalized determinants are
Special-function evaluation alone is not an independent check. Instead, shoot the ODE from
and define . Around a Taylor center , write
The differential equation gives the exact recurrence
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 .
The determinant normalization is exact
Section titled “The determinant normalization is exact”The Airy Wronskian is
Consequently,
has the declared initial data, and hence
This zero-free normalization identity checks the Airy determinant’s phase as well as its zero set.
At , 75-decimal arithmetic, eight Taylor steps, and order 60 give
| Quantity | High-precision value or result |
|---|---|
| First zero | |
| Second zero | |
| Airy versus Taylor-shooting roots | Agreement better than ; a second Taylor grid agrees beyond |
| Rectangle , $ | \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 to 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,
the count remains two while tends to zero. Ordinary Newton conditioning therefore deteriorates even though the contour count is stable. The augmented equations and the nonzero derivatives and 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”:
Here is the coefficient count, the arithmetic precision, the number and order of Taylor steps, and the remaining entries describe the rational approximation, contour, quadrature, and root solve.
| Refinement axis | Primary failure mode exposed |
|---|---|
| Insufficient formal or Borel information | |
| Dependence on rational-continuation shape | |
| Padé-system conditioning and roundoff | |
| Wrong ray, lateral class, or poor pole clearance | |
| Tail truncation and quadrature | |
| Root tolerance and contour nodes | Missed roots or incomplete polishing |
| or match point | Independent 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 , the schematic determinant-evaluation decomposition
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 is a simple zero, is the polished approximate zero, the determinant error is bounded by on a neighborhood , and stays away from zero there, then the first-order estimate is
This estimate becomes ineffective near a multiple zero, exactly where the exceptional-point calculation finds .
Every published value should carry a reproduction manifest:
- software and version;
- coefficient provenance and Borel normalization;
- cycle, branch, chamber, and phase of ;
- and any Borel-variable scaling;
- Laplace angle, lateral offset, interval splitting, and tail rule;
- working precision and guard digits;
- determinant normalization and spectral sheet;
- root-count contour and refinement;
- the complete stability table; and
- an independent comparison target.
A reproducible checker
Section titled “A reproducible checker”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 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.
Common pitfalls
Section titled “Common pitfalls”Mixing Borel conventions. The shifted transform used here has no 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.
Exercises
Section titled “Exercises”1. Construct the Padé system
Section titled “1. Construct the Padé system”Starting from
derive the equations for and . Explain what a singular denominator system means.
Solution
The coefficient of in the product is
For , this coefficient must equal . For , the numerator has no such coefficient, so
These last equations determine the denominator; the first 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.
2. Catch the factorial shift
Section titled “2. Catch the factorial shift”Let
Derive its shifted Borel transform. What series is reconstructed if is used instead of ?
Solution
The monomial maps to . With ,
If one instead uses , termwise Laplace inversion gives
The reconstructed coefficient is divided by . Equivalently,
with the value at 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 of with . Why is the same substitution unsafe for a generic exact-WKB series?
Solution
Only powers occur in . The shifted transform lowers each exponent by one, so only occur. Setting gives
Thus . A generic Borel transform contains both even and odd powers, and singularities at and can carry different continuation data. Replacing by without an actual symmetry collapses those two directions.
4. Recover the Weber lateral sign
Section titled “4. Recover the Weber lateral sign”At and , use the Weber residues to calculate
Solution
The positive imaginary poles are . Their Laplace weights are
Page 2’s upper-minus-lower convention contributes times each residue. Since
the discontinuity is
The sign is tied to the declared lateral ordering and cannot be inferred from the magnitude of the jump alone.
5. Bound a rational Laplace tail
Section titled “5. Bound a rational Laplace tail”Prove the tail bound in the text from
Solution
The Laplace kernel contributes at most , with . Set . Then
With and then ,
This proves the displayed result. It bounds the chosen rational integrand, not the unknown Padé modeling error.
6. Diagnose a close Padé pole and zero
Section titled “6. Diagnose a close Padé pole and zero”A denominator pole and numerator zero satisfy . Give a refinement test that distinguishes a likely Froissart doublet from a pole–zero chain representing a cut.
Solution
Track while varying , 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 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 throughout the root-count region.
7. Prove scaled-determinant covariance
Section titled “7. Prove scaled-determinant covariance”Let and rescale the endpoint columns by analytic nonzero functions and . Show that every zero and its multiplicity is preserved.
Solution
Multilinearity gives
At a zero , write
Then
and the bracket is nonzero at . The multiplicity is unchanged. This fails if either scale factor vanishes or has a pole there.
8. Recover two roots from contour moments
Section titled “8. Recover two roots from contour moments”Assume encloses exactly two simple zeros and no poles. Express the roots using . What changes at a double zero?
Solution
The moments are
Set
Since
the roots are . At a double zero, and the moment data return the repeated root . The moments alone do not prove defectiveness; one must audit , the operator pencil, and the geometric multiplicity.
9. Derive the Airy Taylor determinant
Section titled “9. Derive the Airy Taylor determinant”Derive the Taylor recurrence for
about , and prove
Solution
Write and . Matching the coefficient of in
gives
with . This is the stated recurrence.
Let with . The solution
vanishes at . Differentiating and using gives . Evaluating at yields
which is the desired identity. Its prefactor is nonzero for , so the shooting and Airy determinants have the same zeros and multiplicities.
10. Reproduce a refinement manifest
Section titled “10. Reproduce a refinement manifest”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 count. Then repeat the Airy root calculation with Taylor grids and . Classify each conclusion as computed, internally converged, cross-verified, or certified.
Solution
The commands are
python3 public/code/advanced-ode/borel-pade-spectral-check.pypython3 -O public/code/advanced-ode/borel-pade-spectral-check.pyA minimal manifest records Python, SymPy, and mpmath versions together with , or , , 75–80 working digits, every shape, the offsets and , both Taylor grids, and both contour meshes. The nonsingular Weber errors should be
| | Padé shape | | |---:|---:|---:| | | | | | | | | | | | | | | | |
For the lateral jump, and give errors and . The first three positive Padé poles approach , , and . The Airy roots begin
Both Taylor grids agree with the Airy determinant to the declared tolerances. Both sampled windings and the independent logarithmic- derivative quadrature return . 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
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.
-
Fix real or complex , the branch of , an homology basis on the double cover, and the turning-point/Stokes chamber.
-
Generate the regularized quantum periods to order , 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.
-
Choose nonsingular or lateral Laplace rays compatible with . Record every deformation and restore the classical factors before forming Voros symbols.
-
Derive the chamber-correct monodromy matrix from those symbols and use
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.
-
Count zeros of by adaptive phase sampling and quadrature before polishing them. Repeat the full refinement tensor, especially across any Stokes-wall crossing.
-
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 . 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, -cycle normalization, operator ordering, polarization, mass shifts, quantum mirror map, and convention. It must also distinguish all-orders NS data from a nonperturbative spectral completion.
References
Section titled “References”- Baker, G. A., Jr., and Graves-Morris, P., Padé Approximants, 2nd ed., Cambridge University Press (1996). Standard reference for Padé construction, defects, continued fractions, and conditional convergence results.
- NIST Digital Library of Mathematical Functions, §3.11(iv), Padé approximations. Gives the coefficient equations and numerical Padé-table conventions.
- Caliceti, E., Meyer-Hermann, M., Ribeca, P., Surzhykov, A., and Jentschura, U. D., “From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions”, Physics Reports 446 (2007), 1–96. Sections 3.2.1–3.2.4 develop Borel–Padé, lateral contours, and conformal continuation.
- Stahl, H., “The Convergence of Padé Approximants to Functions with Branch Points”, Journal of Approximation Theory 91 (1997), 139–204. Establishes the precise capacity-convergence setting often invoked too broadly.
- Voros, A., “The Return of the Quartic Oscillator: The Complex WKB Method”, Annales de l’Institut Henri Poincaré A 39 (1983), 211–338, and Delabaere, E., and Pham, F., “Resurgent Methods in Semi-Classical Asymptotics”, 71 (1999), 1–94. Supply the exact-WKB and resurgent setting for the numerical objects used here.
- Ito, K., Mariño, M., and Shu, H., “TBA Equations and Resurgent Quantum Mechanics”, Journal of High Energy Physics 2019 (2019), 228. Compares Borel-resummed quantum periods, exact quantization, and independent integral-equation spectra.
- Delves, L. M., and Lyness, J. N., “A Numerical Method for Locating the Zeros of an Analytic Function”, Mathematics of Computation 21 (1967), 543–560. Develops argument-principle moments for zero location.
- Beyn, W.-J., “An Integral Method for Solving Nonlinear Eigenvalue Problems”, Linear Algebra and its Applications 436 (2012), 3839–3863. Treats contour moments, multiplicities, nonlinear eigenvalues, and quadrature errors.
- Trefethen, L. N., and Weideman, J. A. C., “The Exponentially Convergent Trapezoidal Rule”, SIAM Review 56 (2014), 385–458. Explains why analytic periodic contour integrands admit rapid trapezoidal convergence and what sets the rate.
- Jorba, À., and Zou, M., “A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods”, Experimental Mathematics 14 (2005), 99–117. Develops arbitrary-order Taylor propagation and its numerical control.
- Johansson, F., “Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic”, IEEE Transactions on Computers 66 (2017), 1281–1292, and “Numerical Integration in Arbitrary-Precision Ball Arithmetic”. Provides a route from high-precision evidence to rigorous enclosures.
- Ahmed, Z., “Eigenvalue Problems for the Complex PT-Symmetric Potential ”, Physics Letters A 364 (2007), 12–16. Gives the Airy hard-box determinant and its exceptional-point spectrum.