Asymptotic Expansions and Poincare Series

⚡ Key Takeaways

Asymptotic expansions are series approximations $f(x) \sim \sum a_n \phi_n(x)$ that capture the behavior of a function near a limit point (often $x\to\infty$ or $x\to 0$ ) without necessarily converging. A Poincaré series is the prototypical case where $\phi_n(x) = x^{-n}$ , and the expansion is asymptotic in the sense of Poincaré: for each fixed truncation, the error is smaller than the last term retained. Applies throughout applied analysis, perturbation theory, special functions, and physics. Introduced rigorously by Henri Poincaré (1886) for celestial mechanics and divergent series.

💡 The Core Insight

The defining demand of an asymptotic expansion is not that the infinite series converge, but that each partial sum be a uniformly good approximation as the variable approaches its limit. Formally, $f(x) \sim \sum_{n=0}^\infty a_n x^{-n}$ means that for every fixed $N$ ,

x^N\left[f(x) - \sum_{n=0}^N a_n x^{-n}\right] \to 0 \quad\text{as } x\to\infty.

The error after $N$ terms is of the order of the first omitted term. This is a fundamentally different mode of approximation than convergence, and it is exactly the mode in which divergent series become useful.

DefinitionAsymptotic Sequence and Asymptotic Expansion

A sequence of functions $\{\phi_n(x)\}_{n\ge 0}$ is an asymptotic sequence (or gauge functions) as $x\to x_0$ if for each $n$ ,

1

\quad \phi_{n+1}(x) = o\big(\phi_n(x)\big) \quad\text{as } x\to x_0,

Derivation hint: $\phi_{n+1}/\phi_n \to 0$ as $x\to x_0$ by definition of little-o; each gauge function is asymptotically smaller than its predecessor. i.e. $\lim_{x\to x_0}\phi_{n+1}(x)/\phi_n(x)=0$ . Given such a sequence, a function $f$ has the asymptotic expansion

2

\quad f(x) \sim \sum_{n=0}^{\infty} a_n\,\phi_n(x) \qquad (x\to x_0)

Derivation hint: this is shorthand for the family of remainder estimates in equation [3], one for each $N$ ; the " $\sim$ " symbol encodes them all. if for every nonnegative integer $N$ the remainder condition holds:

3

\quad f(x) - \sum_{n=0}^{N} a_n\,\phi_n(x) = o\big(\phi_N(x)\big) \quad (x\to x_0).

Derivation hint: subtract the $N$ -term partial sum; the residual must vanish faster than the last gauge function retained — equivalently it is $O(\phi_{N+1})$ when the next term exists. Here the symbols are: $x$ the (real or complex) variable; $x_0$ the limit point (commonly $\infty$ ); $\phi_n$ the gauge functions; $a_n$ the (uniquely determined) asymptotic coefficients.

DefinitionPoincaré-Type (Power) Asymptotic Series

The Poincaré series is the special case $x_0=\infty$ with gauge functions $\phi_n(x)=x^{-n}$ (possibly preceded by a factor such as $e^{x}$ or $x^\alpha$ ). One writes

4

\quad f(x) \sim \sum_{n=0}^{\infty} \frac{a_n}{x^{n}} \qquad (x\to\infty),

Derivation hint: substitute $\phi_n=x^{-n}$ into [2]; the gauge property [1] holds since $x^{-(n+1)}/x^{-n}=x^{-1}\to0$ . meaning that for every $N$ ,

5

\quad \lim_{x\to\infty} x^N\!\left[f(x) - \sum_{n=0}^N \frac{a_n}{x^n}\right] = 0.

Derivation hint: multiply [3] by $x^N=1/\phi_N$ ; the remainder condition becomes the limit-zero statement above. An expansion is said to be asymptotic in the sense of Poincaré when it satisfies [5]. Crucially, no claim is made about $\sum a_n x^{-n}$ converging.

TheoremUniqueness of Asymptotic Coefficients

Given a fixed asymptotic sequence $\{\phi_n\}$ , the coefficients $a_n$ of an asymptotic expansion of $f$ are uniquely determined by $f$ , and recovered by

6

\quad a_n = \lim_{x\to x_0}\frac{\,f(x) - \sum_{k=0}^{n-1} a_k\phi_k(x)\,}{\phi_n(x)}.

Derivation hint: rearrange [3] with $N=n$ , divide by $\phi_n$ , and take the limit; the $o(\phi_n)$ remainder contributes nothing.

⚠️ One function, many series — but each series, one function only

Uniqueness is one-directional. A given $f$ has unique coefficients relative to a chosen gauge sequence, but a single asymptotic series can represent infinitely many distinct functions: $f(x)$ and $f(x)+e^{-x}$ share the same Poincaré series as $x\to+\infty$ , because $e^{-x}=o(x^{-n})$ for every $n$ . Such subdominant (or recessive, beyond-all-orders) terms are invisible to the power series. This is the seed of exponential asymptotics and Stokes phenomena.

ProofExistence and Construction of the Coefficients

We show that if the limits defining the $a_n$ exist, the remainder conditions [3] follow, and conversely. 1. Define $a_0$ . Suppose $f(x)/\phi_0(x)\to a_0$ . Then $f(x)-a_0\phi_0(x)=o(\phi_0(x))$ , establishing [3] for $N=0$ . 2. Inductive step. Assume $a_0,\dots,a_{n-1}$ have been constructed so that

7

\quad R_{n-1}(x) := f(x)-\sum_{k=0}^{n-1}a_k\phi_k(x) = o(\phi_{n-1}(x)).

Derivation hint: this is exactly the remainder condition [3] at level $N=n-1$ , the induction hypothesis. 3. Extract the next coefficient. Define $a_n=\lim_{x\to x_0} R_{n-1}(x)/\phi_n(x)$ , assumed to exist. Then

8

\quad R_n(x) = R_{n-1}(x) - a_n\phi_n(x) = \big(a_n+o(1)\big)\phi_n(x)-a_n\phi_n(x)=o(\phi_n(x)).

Derivation hint: substitute $R_{n-1}=(a_n+o(1))\phi_n$ from the limit definition; the leading terms cancel, leaving $o(\phi_n)$ . 4. Conclusion. By induction [3] holds for all $N$ , so $f\sim\sum a_n\phi_n$ . Uniqueness follows because [6] determines each $a_n$ from $f$ and the previously fixed coefficients with no freedom. 5. No convergence is invoked. Nowhere did we let $N\to\infty$ ; the construction is purely term-by-term as $x\to x_0$ . This is why the series may diverge while every partial sum is sharp. $\qquad\blacksquare$

∎

ExampleWhy divergent series are still optimal — error control

For the Watson–Borel model the remainder after $N$ terms of a Poincaré series is typically bounded by the first omitted term:

9

\quad \left|f(x)-\sum_{n=0}^{N}\frac{a_n}{x^n}\right| \le \frac{|a_{N+1}|}{x^{N+1}},

Derivation hint: for alternating/integral-representable series, integration by parts plus a sign-definite remainder integral yields a bound by the next term — the hallmark of well-behaved asymptotic series. When $|a_n|\sim n!/c^n$ (factorial divergence), the bound is minimized near $N^* \approx c\,x$ , giving an optimal truncation error $\sim e^{-c x}$ — exponentially small even though the full series diverges.

HP

Henri Poincaré

1854–1912

The French polymath Henri Poincaré placed divergent series on a rigorous footing in his 1886 Acta Mathematica memoir Sur les intégrales irrégulières des équations linéaires, motivated by the perturbation series of celestial mechanics that astronomers (notably the lunar theorists) had used for decades without justification. Poincaré recognized that these series, though divergent, gave the best numerical results when truncated, and he formalized this by the remainder condition [5]. His insight reconciled the working practice of mathematical astronomy with the demands of rigorous analysis, and the definition bearing his name remains the standard. He simultaneously developed much of the qualitative theory of differential equations and dynamical systems, in which such asymptotic methods are indispensable.

🧠 Convergence vs. asymptoticity — two orthogonal limits

Picture a doubly-indexed error $E(N,x)$ — the discrepancy between $f$ and the $N$ -term partial sum at the point $x$ .

A convergent series controls the limit $N\to\infty$ at fixed $x$ : $E(N,x)\to0$ .
An asymptotic series controls the limit $x\to x_0$ at fixed $N$ : $E(N,x)/\phi_N(x)\to0$ .

These are independent. A series can be both (Taylor series of $e^x$ ), neither, asymptotic-but-divergent (Stirling), or convergent-but-not-asymptotic (a slowly converging series may need many terms to be accurate near $x_0$ ). For divergent asymptotic series there is an optimal $N$ for each $x$ : error decreases, bottoms out, then grows. You "superasymptotically" follow the sum down to the smallest term and stop.

Figure

Error of a divergent asymptotic series versus number of terms retained, showing the optimal truncation valley

ExampleThe exponential integral — a textbook divergent Poincaré series

Given. The exponential integral $E_1(x)=\int_x^\infty \frac{e^{-t}}{t}\,dt$ for large real $x>0$ . We want its asymptotic expansion.

Step 1 — integrate by parts repeatedly. With $u=1/t$ , $dv=e^{-t}dt$ :

10

\quad E_1(x)=\frac{e^{-x}}{x}-\int_x^\infty\frac{e^{-t}}{t^2}\,dt.

Derivation hint: integrate $e^{-t}$ to $-e^{-t}$ , differentiate $1/t$ to $-1/t^2$ ; the boundary term gives $e^{-x}/x$ .

Step 2 — iterate $N$ times.

11

\quad E_1(x)=e^{-x}\sum_{n=0}^{N-1}\frac{(-1)^n\,n!}{x^{n+1}} + R_N, \qquad R_N=(-1)^N N!\!\int_x^\infty\frac{e^{-t}}{t^{N+1}}\,dt.

Derivation hint: each integration by parts pulls down a factor $-n/t$ , generating the factorial and alternating sign; the leftover integral is $R_N$ .

Step 3 — bound the remainder. Since $t\ge x$ in the integral, $t^{-(N+1)}\le x^{-(N+1)}$ :

12

\quad |R_N| \le N!\,x^{-(N+1)}\!\int_x^\infty e^{-t}dt = \frac{N!\,e^{-x}}{x^{N+1}},

Derivation hint: pull the maximal $t^{-(N+1)}=x^{-(N+1)}$ out of the integral; the remaining $\int_x^\infty e^{-t}=e^{-x}$ . which equals the first omitted term — confirming the Poincaré property [5]. The series $\sum (-1)^n n!/x^{n+1}$ diverges for every $x$ (terms eventually grow), yet truncating at $N^*\approx x$ gives error $\sim e^{-x}\sqrt{2\pi x}/$ ... i.e. exponentially small.

Boxed answer.

\boxed{\,E_1(x)\sim e^{-x}\left(\frac{1}{x}-\frac{1}{x^2}+\frac{2}{x^3}-\frac{6}{x^4}+\cdots\right),\quad x\to\infty\,}

At $x=5$ : optimal truncation ( $N^*\approx5$ ) gives $E_1(5)\approx0.0011482955$ versus exact $0.00114830$ — error $<10^{-7}$ from a divergent series.

ExampleStirling's series for the log-gamma function

Given. $\ln\Gamma(z)$ for large $|z|$ , $|\arg z|<\pi$ . Derive its asymptotic form.

Step 1 — Binet / Euler–Maclaurin. Applying the Euler–Maclaurin formula to $\sum\ln k$ (or Binet's integral representation):

13

\quad \ln\Gamma(z)\sim\left(z-\tfrac12\right)\ln z - z + \tfrac12\ln(2\pi) + \sum_{n=1}^{\infty}\frac{B_{2n}}{2n(2n-1)\,z^{2n-1}},

Derivation hint: the Euler–Maclaurin correction terms involve Bernoulli numbers $B_{2n}$ ; the leading $(z-\tfrac12)\ln z - z$ comes from $\int\ln t\,dt$ and the trapezoidal endpoint.

Step 2 — display first coefficients. Using $B_2=\tfrac16$ , $B_4=-\tfrac1{30}$ :

14

\quad \ln\Gamma(z)\sim\left(z-\tfrac12\right)\ln z - z + \tfrac12\ln(2\pi)+\frac{1}{12z}-\frac{1}{360z^3}+\frac{1}{1260z^5}-\cdots

Derivation hint: $\frac{B_2}{2\cdot1}=\frac{1}{12}$ , $\frac{B_4}{4\cdot3}=-\frac{1}{360}$ , $\frac{B_6}{6\cdot5}=\frac{1}{1260}$ .

Step 3 — divergence. Since $|B_{2n}|\sim \dfrac{2(2n)!}{(2\pi)^{2n}}$ , the term ratio grows like $(n/\pi z)^2$ — the series diverges for all $z$ , yet is the gold standard for computing factorials.

Boxed answer (Stirling for the factorial). Exponentiating,

\boxed{\,n!\sim\sqrt{2\pi n}\left(\frac{n}{e}\right)^{n}\!\left(1+\frac{1}{12n}+\frac{1}{288n^2}-\cdots\right)\,}

At $n=10$ : leading factor gives $3598695.6$ vs exact $10!=3628800$ (0.83% error); the $1/12n$ correction gives $3628685$ — error reduced to $0.003\%$ , units: dimensionless count.

⚠️ Asymptotic ≠ convergent; "more terms" can be worse

The single most damaging error is treating an asymptotic series like a Taylor series. Adding terms beyond the optimal $N^*$ makes the approximation worse, not better. There is no "sum to infinity" to compute. Likewise, you cannot freely substitute $x\to0$ or differentiate/integrate term-by-term without justification: differentiation of an asymptotic expansion is not automatically valid (though integration usually is, and differentiation is valid for analytic functions in a sector). Always retain explicit remainder bounds.

CounterexampleA function indistinguishable from zero by its Poincaré series

Let $f(x)=e^{-x}$ as $x\to+\infty$ . For every $n$ ,

15

\quad \lim_{x\to\infty} x^n e^{-x}=0,

Derivation hint: exponential decay beats any polynomial growth; L'Hôpital $n$ times reduces $x^n/e^x$ to $n!/e^x\to0$ . so all asymptotic coefficients vanish: $e^{-x}\sim 0 + 0\cdot x^{-1}+0\cdot x^{-2}+\cdots$ . The zero function has the same Poincaré series. Hence the map {function} $\to$ {Poincaré series} is not injective: the entire ideal of subdominant terms $\{e^{-x}, e^{-x}/x,\dots\}$ is annihilated. Recovering these requires resurgence theory and the resummation of the divergent tail (Borel summation, optimal truncation, hyperasymptotics).

connection · How this binds the analytic landscape together

Asymptotic expansions sit at a crossroads. They are produced by Watson's Lemma and the Method of Steepest Descent from integral representations, and by WKB Approximation and the theory of Irregular Singular Points from differential equations. The divergence of the typical Poincaré series is tamed by Borel Summation and the broader program of Resurgence Theory (Écalle's alien calculus), which restores the subdominant terms hidden by Stokes Phenomenon. The coefficients themselves are organized by Euler–Maclaurin Formula (for sums) and connect to Bernoulli Numbers. In algebra and number theory the word "Poincaré series" also denotes a generating function $\sum \dim(V_n)t^n$ — a distinct meaning not to be confused with the asymptotic notion here. The framework underlies all of Perturbation Theory and singular Boundary Layer Theory.

🔬 Where Poincaré-type asymptotics decide the answer

⏳ History

- 1730s–1750s — Euler & Stirling. Stirling (1730) and de Moivre derive the factorial asymptotics; Euler manipulates divergent series boldly and computes their "values," anticipating summation methods but without rigor.

- 1768 — Euler's $E_1$ series. Euler studies the divergent series for what is now the exponential integral, noting its remarkable numerical accuracy despite divergence.

- 1820s — Cauchy & Abel. The rise of rigor; Abel famously calls divergent series "an invention of the devil," and they fall into disrepute even as astronomers keep using them.

- 1886 — Poincaré. Sur les intégrales irrégulières des équations linéaires (Acta Math.) gives the precise definition [5], legitimizing divergent asymptotic series and tying them to ODEs with irregular singular points.

- 1886 — Stieltjes. Independently formalizes asymptotic series and pioneers the link to continued fractions and the moment problem (Stieltjes integral).

- 1902–1918 — Watson, Barnes. G. N. Watson proves Watson's Lemma (asymptotics of Laplace-type integrals) and develops the theory systematically; Barnes integrals give exact and asymptotic representations.

- 1899–1918 — Borel. Émile Borel develops Borel summation, the first systematic method to assign sums to divergent asymptotic series.

- 1857 / 1864 — Stokes (retrospectively). Stokes' discovery of the discontinuous appearance/disappearance of subdominant exponentials (the Stokes phenomenon) is later recognized as central.

- 1980s–1990s — Écalle, Berry, Dingle. Resurgence theory (Écalle), Dingle's interpretation of late terms, and Berry's smoothing of the Stokes phenomenon and hyperasymptotics push beyond all orders, recovering the exponentially small terms invisible to Poincaré.

open-problem · Beyond all orders: resummation and uniqueness

The Poincaré definition deliberately discards exponentially small (beyond-all-orders) information, which is precisely the information that often controls physical phenomena: tunneling rates, separatrix splitting, instanton contributions, and Stokes transitions. The central open territory is exact resummation: given the divergent coefficients $a_n$ , can one uniquely reconstruct $f$ ? Borel summation works when the Borel transform $\sum a_n t^n/n!$ has analytic continuation with no singularities on the positive axis; otherwise lateral Borel sums differ by exponentially small amounts — the Stokes ambiguity. Écalle's resurgence organizes these ambiguities via alien derivatives and transseries ( $\sum_k e^{-A_k/x} x^{b_k}\sum_n a_{k,n}x^{-n}$ ), conjecturally rendering many physical series resurgent and resummable. Outstanding questions: which classes of nonlinear ODEs/PDEs and which QFT perturbation series are provably resurgent; sharp error bounds in hyperasymptotic (multi-level) expansions; and the rigorous status of resurgent resummation in genuinely strongly coupled regimes.

Asymptotic Expansions and Poincare Series

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also