Perturbation Theory Automation
Perturbation theory can be automated by solving an ordered sequence of projected linear problems. The automation removes repeated algebra; it does not establish that a series converges or that a chosen unperturbed level remains isolated. This page treats a nondegenerate reference state and separates coefficient generation from validation at a finite coupling.
Required background. Nondegenerate perturbation theory develops the physical expansion and its assumptions; symbolic operator algebra supplies ordered products and exact simplification.
A recurrence with fixed normalization
Section titled “A recurrence with fixed normalization”Let and , with an isolated simple eigenvalue. Use intermediate normalization,
and . Matching powers of gives
Here denotes the reference ket, not the zero vector. Projecting onto the reference state yields
Define and the reduced inverse , with inversion only on the complementary subspace. Then
Compute before , store earlier orders, and reuse a factorization of the projected operator when possible. Do not invert on the full space: it is singular by construction. In an eigenbasis, the reduced inverse is diagonal with entries for .
A two-level exact check
Section titled “A two-level exact check”Take and real ,
For the reference state , the recurrence gives , , and . Continuing gives and . The exact lower eigenvalue is
This example checks signs of energy denominators, order bookkeeping, and symmetry under . At small coupling, evaluate the exact expression in a cancellation-resistant form, .
The nearest complex branch points are for , so the Taylor radius is . Smooth behavior on the real axis does not imply convergence at arbitrarily large real coupling.
Checking generated coefficients
Section titled “Checking generated coefficients”Substitute the truncated energy and state series back into . Every coefficient through the retained order should vanish exactly or within a stated arithmetic tolerance. Verify the reference overlap separately. A residual at finite should scale with the first omitted power when the asymptotic regime is resolved.
Intermediate normalization is not unit normalization. Before computing a physical expectation value, use
and expand numerator and denominator consistently to the same target order. Normalizing a truncated state numerically is useful for comparison, but silently mixes higher-order terms and is not identical to an order-by-order symbolic expansion.
For an infinite basis, coefficient generation introduces a second truncation in intermediate states. Increase that cutoff independently of perturbative order. Polynomial oscillator perturbations often connect only a finite band at each fixed order; using that selection rule is more reliable than assuming a small fixed matrix is always sufficient.
Degeneracies and divergent expansions
Section titled “Degeneracies and divergent expansions”Small denominators warn that the chosen reference decomposition is inappropriate. For exact degeneracy, construct and diagonalize the effective perturbation in the degenerate subspace before applying a reduced inverse. See degenerate perturbation theory. An arbitrary small regulator in the denominator does not perform this reorganization.
Some physically useful perturbation series are asymptotic rather than convergent. Increasing order can initially improve and eventually worsen an answer. Compare successive truncations and an independent calculation; a symbolic system’s ability to generate a coefficient does not imply that summing more coefficients improves the prediction.
Exercises
Section titled “Exercises”For the two-level example, take , . Find the energy through fourth order and the Taylor radius.
Solution
and the radius is one. At the series is on its convergence boundary; an interior asymptotic accuracy argument cannot be assumed there.
References
Section titled “References”- Kato, T., Perturbation Theory for Linear Operators, 2nd ed., Springer, 1976 — isolated spectral subspaces and analytic perturbation.
- Meurer, A., et al., “SymPy: Symbolic Computing in Python,” PeerJ Computer Science 3, e103 (2017), article — symbolic series and algebraic verification.
- Sakurai, J. J., and J. Napolitano, Modern Quantum Mechanics, 3rd ed., Cambridge University Press, 2021 — nondegenerate and degenerate quantum perturbation theory.