Book 2B

© 2026 NeckPinch · www.neckpinch.com · All rights reserved.

Course 2Book 2B: Spaces, Functions and ChangeChapter 6

Power Series, Exponentials and Bump Functions

Analytic functions, exp and log, the matrix exponential, and smooth functions that are not analytic.

35 min read · Updated Oct 2, 2026

Read with Tao, Analysis II, chapter "Power series": formal power series, real analytic functions, Abel's theorem, multiplication of power series, the exponential and logarithm functions, the digression on complex numbers, and trigonometric functions. The matrix exponential and bump functions are not in Tao; this chapter covers them.

In this chapter · 8 sections
  1. 6.1Dating by decay
  2. 6.2Power series
  3. 6.3The exponential and the logarithm
  4. 6.4Complex exponentials and trigonometry
  5. 6.4.1Why the series for 11+x2\frac{1}{1+x^2}1+x21​ stops at 111
  6. 6.5The matrix exponential
  7. 6.6Smooth functions that are not analytic
  8. 6.6.1Bumps and cutoffs
  9. 6.7History
  10. 6.8Exercises

A power series is a polynomial that never stops: ∑n=0∞cnxn\sum_{n=0}^\infty c_n x^n. Power series are where the functions of school mathematics, exe^x, log⁡x\log x, sin⁡x\sin x and cos⁡x\cos x, finally get definitions rather than descriptions. In Book 2A we used them on trust, and every property assumed there is proved here, using the uniform convergence of 2B.5 Uniform Convergence and Arzelà–Ascoli.

The chapter then goes in two directions that the rest of the guidebook needs. First, the exponential makes sense for matrices, and etAe^{tA} solves every linear system of differential equations x′=Axx' = Ax (2B.10 Ordinary Differential Equations). Second, there are functions that are infinitely differentiable but are not given by their power series. The simplest, e−1/x2e^{-1/x^2}, is so flat at 00 that every derivative vanishes there. From it we build bump functions and smooth cutoffs: smooth functions that are 11 on one region and 00 outside a slightly larger one. They are humble objects, and they are indispensable. Every local estimate in geometric analysis, including the one at the heart of Perelman's noncollapsing theorem, multiplies by a cutoff function.

By the end of this chapter you will be able to:

  • find the radius of convergence of a power series, and differentiate and integrate one term by term;
  • define exp⁡\exp, log⁡\log, real powers, sin⁡\sin and cos⁡\cos from scratch and prove their main properties;
  • explain why the real power series of 11+x2\frac{1}{1+x^2} stops converging at ∣x∣=1|x| = 1;
  • compute matrix exponentials and use them to solve x′=Axx' = Ax;
  • prove that e−1/x2e^{-1/x^2} is smooth and not analytic, and build smooth bumps and cutoffs with prescribed properties.

Dating by decay

In the world Data Radiocarbon ages

Living organisms take in carbon from the atmosphere, including a small, nearly constant fraction of radioactive carbon-14. After death the intake stops, and the carbon-14 decays. The number N(t)N(t) of carbon-14 atoms remaining after time tt satisfies

N′(t)=−λN(t),soN(t)=N0 e−λt,N'(t) = -\lambda N(t), \qquad\text{so}\qquad N(t) = N_0\,e^{-\lambda t},

because each atom decays independently at a constant rate. The half-life T1/2T_{1/2}, the time for half to decay, is ln⁡2/λ\ln 2/\lambda. Its best value, determined in the early 1960s and agreed at a 1962 conference in Cambridge, is 5730±405730 \pm 40 years.

If a sample of wood retains 60%60\% of the carbon-14 of living wood, its age is

t=T1/2ln⁡2 ln⁡10.6=8267×0.5108≈4220 years.t = \frac{T_{1/2}}{\ln 2}\,\ln\frac{1}{0.6} = 8267 \times 0.5108 \approx 4220 \text{ years}.

The ±40\pm 40-year uncertainty in the half-life alone moves this by about ±30\pm 30 years.

Two facts keep this honest. First, laboratories by convention report a conventional radiocarbon age, computed with the original half-life measured by Willard Libby, 55685568 years, as standardised by Stuiver and Polach in 1977; with it the same sample is about 41004100 "radiocarbon years" old. Second, the carbon-14 content of the atmosphere has not been perfectly constant, so radiocarbon ages are converted into calendar ages using calibration curves built from tree rings and other records of known age. The exponential law is exact for the decay. The input it is fed, the starting fraction, is what needs calibrating.

The example uses three facts we haven't yet proved: that a function equal to its own derivative (up to a constant factor) must be an exponential, that exp⁡\exp has an inverse log⁡\log, and that exp⁡\exp turns sums into products, which is why a half-life is the same at every age. All three are proved below.

Power series

Definition 6.1 Power series and radius of convergence

A power series centred at aa is a series ∑n=0∞cn(x−a)n\sum_{n=0}^\infty c_n(x - a)^n with real (or complex) coefficients cnc_n. Its radius of convergence is

R=1lim sup⁡n→∞∣cn∣1/n∈[0,∞],R = \frac{1}{\limsup_{n\to\infty}|c_n|^{1/n}} \in [0, \infty],

with the conventions 1/0=∞1/0 = \infty and 1/∞=01/\infty = 0.

Theorem 6.2 What the radius of convergence says

Let ∑cn(x−a)n\sum c_n(x - a)^n have radius of convergence RR.

  1. For ∣x−a∣>R|x - a| > R the series diverges.
  2. For ∣x−a∣<R|x - a| < R it converges absolutely, and on every closed interval [a−r,a+r][a - r, a + r] with r<Rr < R it converges uniformly. So its sum ff is continuous on (a−R,a+R)(a - R, a + R).
  3. ff is differentiable on (a−R,a+R)(a - R, a + R), and its derivative is the series differentiated term by term, f′(x)=∑n≥1n cn(x−a)n−1f'(x) = \sum_{n \geq 1} n\,c_n(x - a)^{n-1}, which has the same radius of convergence. Hence ff is infinitely differentiable, and cn=f(n)(a)/n!c_n = f^{(n)}(a)/n!.

Proof. (1) and absolute convergence in (2) are the root test of 2A.7 Series applied to ∣cn(x−a)n∣|c_n(x - a)^n|, since lim sup⁡∣cn(x−a)n∣1/n=∣x−a∣/R\limsup|c_n(x - a)^n|^{1/n} = |x - a|/R. For uniform convergence, pick r<s<Rr < s < R. Then ∣cn∣≤s−n|c_n| \leq s^{-n} for large nn, so on ∣x−a∣≤r|x - a| \leq r we have ∣cn(x−a)n∣≤(r/s)n|c_n(x - a)^n| \leq (r/s)^n, a convergent geometric series; the M-test (2B.5 Uniform Convergence and Arzelà–Ascoli) applies.

(3) Since n1/n→1n^{1/n} \to 1, the differentiated series has the same lim sup⁡\limsup, hence the same radius. By (2) it converges uniformly on each [a−r,a+r][a - r, a + r], and the partial sums of the original series converge at aa. So 2B.5 Uniform Convergence and Arzelà–Ascoli's theorem on derivatives of limits gives f′=∑ncn(x−a)n−1f' = \sum n c_n(x - a)^{n-1}. Repeating, f(k)(a)=k! ckf^{(k)}(a) = k!\,c_k.

At ∣x−a∣=R|x - a| = R anything can happen: ∑xn\sum x^n diverges at both ends of (−1,1)(-1, 1), ∑xn/n\sum x^n/n converges at −1-1 but not at 11, and ∑xn/n2\sum x^n/n^2 converges at both.

Definition 6.3 Real analytic

A function ff on an open interval II is real analytic if near every point a∈Ia \in I it equals a power series centred at aa with positive radius of convergence. By Theorem 6.2, that series must be its Taylor series, ∑f(n)(a)n!(x−a)n\sum \frac{f^{(n)}(a)}{n!}(x - a)^n.

Analytic functions are rigid. If an analytic function on an interval vanishes on some small subinterval, it vanishes on the whole interval (Exercise 6.13). This rigidity is why analytic functions are not enough for geometry, and why the smooth non-analytic functions at the end of the chapter are needed.

Abel's theorem. If ∑cn\sum c_n converges, then ∑cnxn→∑cn\sum c_n x^n \to \sum c_n as x→1−x \to 1^-: the sum is continuous at the endpoint, from inside, whenever the series converges there. For example ln⁡(1+x)=x−x22+x33−⋯\ln(1 + x) = x - \frac{x^2}{2} + \frac{x^3}{3} - \cdots for ∣x∣<1|x| < 1 (integrate 11+x=∑(−x)n\frac{1}{1+x} = \sum(-x)^n term by term), and the alternating harmonic series converges (2A.7 Series), so Abel's theorem gives

1−12+13−14+⋯=ln⁡2.1 - \tfrac12 + \tfrac13 - \tfrac14 + \cdots = \ln 2.

Tao proves the theorem by summation by parts; the proof is worth reading once.

The exponential and the logarithm

Definition 6.4 The exponential function
exp⁡(x)=∑n=0∞xnn!=1+x+x22+x36+⋯\exp(x) = \sum_{n=0}^\infty \frac{x^n}{n!} = 1 + x + \frac{x^2}{2} + \frac{x^3}{6} + \cdots

Since (1/n!)1/n→0(1/n!)^{1/n} \to 0 (for instance by the ratio test), the radius of convergence is infinite, and exp⁡\exp is defined, continuous and infinitely differentiable on all of R\mathbb{R}. Differentiating term by term, exp⁡′=exp⁡\exp' = \exp, and exp⁡(0)=1\exp(0) = 1. Everything else follows from these two facts.

Proposition 6.5 Properties of exp
  1. (Uniqueness) If f′=cff' = cf on an interval containing 00, then f(x)=f(0)exp⁡(cx)f(x) = f(0)\exp(cx) there.
  2. exp⁡(x+y)=exp⁡(x)exp⁡(y)\exp(x + y) = \exp(x)\exp(y) for all real x,yx, y.
  3. exp⁡(x)>0\exp(x) > 0, and exp⁡\exp is a strictly increasing bijection from R\mathbb{R} onto (0,∞)(0, \infty).

Proof. First, exp⁡(x)exp⁡(−x)=1\exp(x)\exp(-x) = 1. The function k(x)=exp⁡(x)exp⁡(−x)k(x) = \exp(x)\exp(-x) has k′=exp⁡(x)exp⁡(−x)−exp⁡(x)exp⁡(−x)=0k' = \exp(x)\exp(-x) - \exp(x)\exp(-x) = 0, so it is constant (2A.10 Derivatives), equal to k(0)=1k(0) = 1. In particular exp⁡\exp never vanishes.

(1) Let g(x)=f(x)exp⁡(−cx)g(x) = f(x)\exp(-cx). By the product and chain rules, g′=cfexp⁡(−cx)−cfexp⁡(−cx)=0g' = cf\exp(-cx) - cf\exp(-cx) = 0, so g(x)=g(0)=f(0)g(x) = g(0) = f(0). Multiplying by exp⁡(cx)\exp(cx) and using exp⁡(cx)exp⁡(−cx)=1\exp(cx)\exp(-cx) = 1 gives f(x)=f(0)exp⁡(cx)f(x) = f(0)\exp(cx).

(2) Fix yy and let h(x)=exp⁡(x+y)exp⁡(−x)h(x) = \exp(x + y)\exp(-x). Then h′=0h' = 0, so h(x)=h(0)=exp⁡(y)h(x) = h(0) = \exp(y). Multiply by exp⁡(x)\exp(x).

(3) For x≥0x \geq 0, exp⁡(x)≥1+x>0\exp(x) \geq 1 + x > 0 from the series; for x<0x < 0, exp⁡(x)=1/exp⁡(−x)>0\exp(x) = 1/\exp(-x) > 0. Since exp⁡′=exp⁡>0\exp' = \exp > 0, exp⁡\exp is strictly increasing. It is unbounded above (exp⁡x≥1+x\exp x \geq 1 + x) and tends to 00 as x→−∞x \to -\infty, so by the intermediate value theorem its image is (0,∞)(0, \infty).

Part 1 is the uniqueness of solutions of the simplest differential equation, f′=cff' = cf. It answers the radiocarbon question: decay at a rate proportional to the amount present must be exponential. Part 2 explains why a half-life makes sense: N(t+T)=N0e−λte−λTN(t + T) = N_0 e^{-\lambda t}e^{-\lambda T}, so waiting a further time TT multiplies what is left by the same factor e−λTe^{-\lambda T}, whatever tt is.

The number e=exp⁡(1)=∑1n!=2.71828…e = \exp(1) = \sum \frac1{n!} = 2.71828\ldots agrees with the limit lim⁡(1+1n)n\lim(1 + \tfrac1n)^n from 2A.6 Sequences (Exercise 6.12). By part 2, exp⁡(q)=eq\exp(q) = e^q for every rational qq, so exp⁡(x)\exp(x) is the real power exe^x in the sense of 2A.6 Sequences, and we write exe^x from now on.

Definition 6.6 The logarithm and real powers

The natural logarithm log⁡:(0,∞)→R\log : (0, \infty) \to \mathbb{R} is the inverse of exp⁡\exp. For a>0a > 0 and real xx, ax=exp⁡(xlog⁡a)a^x = \exp(x\log a).

The inverse function theorem of one variable (2A.10 Derivatives) gives log⁡′(y)=1/exp⁡(log⁡y)=1/y\log'(y) = 1/\exp(\log y) = 1/y. With log⁡1=0\log 1 = 0 and the fundamental theorem, log⁡y=∫1ydtt\log y = \int_1^y \frac{dt}{t}: the logarithm of 2A.11 The Riemann Integral, defined as an area, is the same function. The rules log⁡(xy)=log⁡x+log⁡y\log(xy) = \log x + \log y, ax+y=axaya^{x+y} = a^xa^y and (ax)y=axy(a^x)^y = a^{xy} follow from part 2 of the proposition. (Mathematicians write log⁡\log for the natural logarithm, and so does the guidebook from here on; ln⁡\ln means the same.)

Complex exponentials and trigonometry

Tao's "digression on complex numbers" is the shortest route to sin⁡\sin and cos⁡\cos. Complex numbers z=x+iyz = x + iy, with i2=−1i^2 = -1 and ∣z∣=x2+y2|z| = \sqrt{x^2 + y^2}, form a complete metric space with d(z,w)=∣z−w∣d(z, w) = |z - w| (it is R2\mathbb{R}^2 with the Euclidean metric). All of Theorem 6.2 works for complex power series, with "interval" replaced by "disc" ∣z−a∣<R|z - a| < R. So

ez=∑n=0∞znn!e^z = \sum_{n=0}^\infty \frac{z^n}{n!}

converges for every complex zz, and the proof of ez+w=ezewe^{z + w} = e^ze^w goes through (or multiply the series, using the binomial theorem; Tao's section on multiplication of power series justifies the rearrangement).

Definition 6.7 Cosine and sine

For real θ\theta, cos⁡θ\cos\theta and sin⁡θ\sin\theta are the real and imaginary parts of eiθe^{i\theta}:

eiθ=cos⁡θ+isin⁡θ(Euler’s formula),e^{i\theta} = \cos\theta + i\sin\theta \qquad (\text{Euler's formula}),
cos⁡θ=1−θ22!+θ44!−⋯ ,sin⁡θ=θ−θ33!+θ55!−⋯ .\cos\theta = 1 - \frac{\theta^2}{2!} + \frac{\theta^4}{4!} - \cdots, \qquad \sin\theta = \theta - \frac{\theta^3}{3!} + \frac{\theta^5}{5!} - \cdots.

Everything about trigonometry follows. Since eiθ‾=e−iθ\overline{e^{i\theta}} = e^{-i\theta}, we get ∣eiθ∣2=eiθe−iθ=1|e^{i\theta}|^2 = e^{i\theta}e^{-i\theta} = 1, that is, cos⁡2θ+sin⁡2θ=1\cos^2\theta + \sin^2\theta = 1. Differentiating the series, cos⁡′=−sin⁡\cos' = -\sin and sin⁡′=cos⁡\sin' = \cos. The addition formulas are the real and imaginary parts of ei(α+β)=eiαeiβe^{i(\alpha + \beta)} = e^{i\alpha}e^{i\beta}. And π\pi can be defined as twice the smallest positive zero of cos⁡\cos; one shows it exists (by the intermediate value theorem, since cos⁡0=1\cos 0 = 1 and cos⁡2<0\cos 2 < 0) and that cos⁡\cos and sin⁡\sin have period 2π2\pi. So t↦eitt \mapsto e^{it} goes once around the unit circle at unit speed as tt runs over [0,2π)[0, 2\pi), which is the connection with angles.

Why the series for 11+x2\frac{1}{1+x^2} stops at 11

The function f(x)=11+x2f(x) = \frac{1}{1+x^2} is perfectly smooth on the whole real line. Its Taylor series at 00 is the geometric series

11+x2=1−x2+x4−x6+⋯ ,\frac{1}{1 + x^2} = 1 - x^2 + x^4 - x^6 + \cdots,

which has radius of convergence 11 and diverges for ∣x∣>1|x| > 1 (Figure 6.1). Nothing happens to ff at x=±1x = \pm 1, so why should the series stop there?

The answer is in the complex plane. As a function of a complex variable, 11+z2\frac{1}{1 + z^2} blows up at z=±iz = \pm i, where 1+z2=01 + z^2 = 0. A complex power series converges on a disc, and the disc centred at 00 can't extend past the nearest point where the function misbehaves. That point, ii, is at distance 11. The real interval of convergence is just the disc's shadow on the real line.

Figure 6.1. Left: partial sums of 1−x2+x4−⋯1 - x^2 + x^4 - \cdots (degrees 2,4,10,202, 4, 10, 20) track 11+x2\frac{1}{1+x^2} for ∣x∣<1|x| < 1 and diverge beyond. Right: the reason. In the complex plane the function has poles at ±i\pm i, and the disc of convergence about 00 reaches exactly to them.

This is the seam to complex analysis (Book 5A, optional), where it becomes a theorem: the radius of convergence of the Taylor series of a complex-differentiable function at a point is the distance to the nearest singularity.

The matrix exponential

The exponential series makes sense whenever we can multiply, add and take limits. For a square matrix AA,

eA=I+A+A22!+A33!+⋯ .e^A = I + A + \frac{A^2}{2!} + \frac{A^3}{3!} + \cdots.

To see that it converges, measure matrices by the operator norm ∥A∥=sup⁡{∣Av∣:∣v∣≤1}\|A\| = \sup\{|Av| : |v| \leq 1\}. It satisfies ∥AB∥≤∥A∥ ∥B∥\|AB\| \leq \|A\|\,\|B\|, so ∥Ak/k!∥≤∥A∥k/k!\|A^k/k!\| \leq \|A\|^k/k!, and the series converges absolutely by the M-test, in the complete space of n×nn \times n matrices (Rn2\mathbb{R}^{n^2}, any norm, 2B.3 Compactness). Moreover ∥eA∥≤e∥A∥\|e^A\| \leq e^{\|A\|}.

Proposition 6.8 The matrix exponential
  1. ddtetA=A etA=etAA\frac{d}{dt}e^{tA} = A\,e^{tA} = e^{tA}A.
  2. For every x0∈Rnx_0 \in \mathbb{R}^n, x(t)=etAx0x(t) = e^{tA}x_0 is the unique solution of x′=Axx' = Ax with x(0)=x0x(0) = x_0.
  3. If AB=BAAB = BA, then eA+B=eAeBe^{A + B} = e^Ae^B. In particular etAe^{tA} is invertible, with inverse e−tAe^{-tA}.

Proof. (1) Each entry of etAe^{tA} is a power series in tt with infinite radius of convergence, so it can be differentiated term by term: ddt∑tkAkk!=∑tk−1Ak(k−1)!\frac{d}{dt}\sum \frac{t^kA^k}{k!} = \sum \frac{t^{k-1}A^k}{(k-1)!}. (2) Existence is (1). For uniqueness, if x′=Axx' = Ax, then ddt(e−tAx(t))=−Ae−tAx+e−tAAx=0\frac{d}{dt}\big(e^{-tA}x(t)\big) = -Ae^{-tA}x + e^{-tA}Ax = 0 (using that AA commutes with e−tAe^{-tA}), so e−tAx(t)=x0e^{-tA}x(t) = x_0, and x(t)=etAx0x(t) = e^{tA}x_0 once we know etAe−tA=Ie^{tA}e^{-tA} = I. (3) As for real numbers: both et(A+B)e^{t(A+B)} and etAetBe^{tA}e^{tB} solve X′=(A+B)XX' = (A + B)X, X(0)=IX(0) = I (this uses AB=BAAB = BA to move BB past etAe^{tA}), so they agree by the uniqueness in (2) applied column by column. With B=−AB = -A this gives etAe−tA=Ie^{tA}e^{-tA} = I.

The hypothesis AB=BAAB = BA is essential: for most pairs of matrices eA+B≠eAeBe^{A+B} \neq e^Ae^B. That failure is the beginning of Lie theory (8A.5 Lie Groups and Group Actions).

Example 6.9 Rotations as exponentials

Let J=(0−110)J = \begin{pmatrix}0 & -1\\ 1 & 0\end{pmatrix}. Then J2=−IJ^2 = -I, so the powers of JJ cycle like the powers of ii, and splitting the series into even and odd terms gives

etJ=(1−t22!+⋯)I+(t−t33!+⋯)J=(cos⁡t−sin⁡tsin⁡tcos⁡t),e^{tJ} = \Big(1 - \frac{t^2}{2!} + \cdots\Big)I + \Big(t - \frac{t^3}{3!} + \cdots\Big)J = \begin{pmatrix}\cos t & -\sin t\\ \sin t & \cos t\end{pmatrix},

the rotation by angle tt. The solution of x′=Jxx' = Jx, a velocity always perpendicular to the position, is uniform motion around a circle. JJ is the matrix of multiplication by ii on C=R2\mathbb{C} = \mathbb{R}^2, and this is Euler's formula again.

In the world In use Rodrigues' rotation formula

Robots, cameras and spacecraft need to represent rotations in space, and a convenient way is by a rotation vector θ ω\theta\,\omega: rotate by angle θ\theta about the unit axis ω\omega. The rotation matrix is the exponential R=eθKR = e^{\theta K} of the skew-symmetric matrix KK with Kv=ω×vKv = \omega \times v. Because K3=−KK^3 = -K, the series collapses, just as in Example 6.9, to Rodrigues' formula

R=I+sin⁡θ K+(1−cos⁡θ) K2.R = I + \sin\theta\,K + (1 - \cos\theta)\,K^2.

Computer-vision libraries convert between rotation vectors and matrices with exactly this formula (OpenCV calls the function Rodrigues), and estimation methods in robotics often work with the rotation vector, which lives in a vector space and can be averaged and differentiated, and only exponentiate at the end.

Where this goes Exponentials later

The matrix exponential solves linear ODEs (2B.10 Ordinary Differential Equations), where the eigenvalues of AA decide whether solutions grow, decay or rotate. Its infinite-dimensional version is the heat semigroup: in 2B.7 Fourier Series and the First Heat Equation the heat equation on a ring is solved by multiplying the kk-th Fourier coefficient by e−4π2k2te^{-4\pi^2k^2t}, which is etΔe^{t\Delta} acting diagonally (6A.3 The Heat Equation on ℝⁿ). On a Lie group, etAe^{tA} traces out one-parameter subgroups (8A.5 Lie Groups and Group Actions), and the exponential map of a Riemannian manifold, which sends a tangent vector to the endpoint of the geodesic it generates, is named after it (9A.3 Geodesics and the Exponential Map).

Smooth functions that are not analytic

Example 6.10 A function flat to infinite order

Let f(x)=e−1/x2f(x) = e^{-1/x^2} for x≠0x \neq 0 and f(0)=0f(0) = 0. Then ff is infinitely differentiable on R\mathbb{R}, and f(n)(0)=0f^{(n)}(0) = 0 for every nn. So its Taylor series at 00 is identically 00, while f(x)>0f(x) > 0 for x≠0x \neq 0: ff is smooth but not analytic at 00.

Proof. Away from 00, by induction, f(n)(x)=pn(1/x) e−1/x2f^{(n)}(x) = p_n(1/x)\,e^{-1/x^2} for some polynomial pnp_n: differentiating pn(1/x)e−1/x2p_n(1/x)e^{-1/x^2} gives (−x−2pn′(1/x)+2x−3pn(1/x))e−1/x2\big(-x^{-2}p_n'(1/x) + 2x^{-3}p_n(1/x)\big)e^{-1/x^2}, again of this form.

At 00, the key fact is that e−1/x2e^{-1/x^2} beats every power: for each kk, x−ke−1/x2→0x^{-k}e^{-1/x^2} \to 0 as x→0x \to 0. (With u=1/x2u = 1/x^2, this is uk/2e−u→0u^{k/2}e^{-u} \to 0 as u→∞u \to \infty, which follows from eu≥umm!e^u \geq \frac{u^m}{m!} for m>k/2m > k/2.) So p(1/x)e−1/x2→0p(1/x)e^{-1/x^2} \to 0 for every polynomial pp. Now suppose f(n)(0)=0f^{(n)}(0) = 0. Then

f(n+1)(0)=lim⁡x→0f(n)(x)−0x=lim⁡x→01x pn(1/x) e−1/x2=0,f^{(n+1)}(0) = \lim_{x \to 0}\frac{f^{(n)}(x) - 0}{x} = \lim_{x\to 0} \frac1x\,p_n(1/x)\,e^{-1/x^2} = 0,

since 1xpn(1x)\frac1x p_n(\frac1x) is again a polynomial in 1x\frac1x. By induction, all derivatives at 00 vanish.

Figure 6.2. e−1/x2e^{-1/x^2} (heavy) and its first two derivatives. Near 00 all three are so flat that they are indistinguishable from 00: every derivative vanishes at the origin, yet the function is not zero.

Cauchy gave this example in 1823 to show that a function is not determined by its Taylor series. For analysis it is a gift: it lets us build smooth functions that are exactly zero in one place and positive in another, which no analytic function can do.

Bumps and cutoffs

Use the one-sided version: ψ(x)=e−1/x\psi(x) = e^{-1/x} for x>0x > 0 and ψ(x)=0\psi(x) = 0 for x≤0x \leq 0. The same proof shows ψ\psi is smooth, with all derivatives 00 at 00. From ψ\psi:

  • A bump. ϕ(x)=ψ(1−x2)\phi(x) = \psi(1 - x^2) is smooth, positive on (−1,1)(-1, 1), and zero outside. In Rn\mathbb{R}^n, ϕ(∣x∣)\phi(|x|) is a smooth bump on the unit ball (smooth even at 00, because 1−∣x∣21 - |x|^2 is a polynomial in the coordinates).
  • A smooth step. S(x)=ψ(x)ψ(x)+ψ(1−x)S(x) = \dfrac{\psi(x)}{\psi(x) + \psi(1 - x)} is smooth (the denominator is never 00), equal to 00 for x≤0x \leq 0, to 11 for x≥1x \geq 1, and increasing in between (Exercise 6.14).
  • A cutoff. χ(x)=S(2−∣x∣)\chi(x) = S(2 - |x|) equals 11 on [−1,1][-1, 1], 00 outside (−2,2)(-2, 2), and is smooth everywhere: near 00 it is constant, so the corner of ∣x∣|x| doesn't matter.
Figure 6.3. Left: the bump ψ(1−x2)\psi(1 - x^2), smooth, positive exactly on (−1,1)(-1, 1). Right: the cutoff χ\chi, equal to 11 on [−1,1][-1, 1] and 00 outside (−2,2)(-2, 2), with a smooth transition in between.

Rescaling gives cutoffs adapted to any scale: χ(x/ρ)\chi(x/\rho) is 11 on the ball of radius ρ\rho and 00 outside radius 2ρ2\rho, and its derivatives scale like ∣χ′(x/ρ)/ρ∣≤C/ρ|\chi'(x/\rho)/\rho| \leq C/\rho and C/ρ2C/\rho^2 for the second derivative (Exercise 6.17). That scaling is the whole art of localising an estimate: the cost of cutting off at radius ρ\rho is a factor 1/ρ1/\rho per derivative.

Where this goes Where bumps and cutoffs are used
  • Mollifiers (3A.8 Convolution and Mollifiers): convolving with a rescaled bump ρ−nϕ(x/ρ)\rho^{-n}\phi(x/\rho) (normalised to integral 11) smooths any integrable function, an approximate identity as in 2B.5 Uniform Convergence and Arzelà–Ascoli.
  • Partitions of unity (8A.2 Partitions of Unity): on a manifold, smooth functions that sum to 11 and are each supported in one coordinate chart. They are how anything defined in charts, from integrals to Riemannian metrics, is glued into a global object. Without non-analytic smooth functions there would be no partitions of unity.
  • Localised estimates: to prove a bound near a point, multiply by a cutoff, prove the bound for the product, and pay for the cutoff's derivatives. In 12A.4 κ-Noncollapsing, Perelman proves κ-noncollapsing by testing his W\mathcal{W}-entropy against a function built from a cutoff of the distance, of the form e−f/2∝χ(dist/r)e^{-f/2} \propto \chi(\mathrm{dist}/r) scaled to a ball of radius rr, and the factors of 1/r1/r from its derivative are exactly what the scale-invariant estimate absorbs.

History

Newton found the binomial series and power series for sine and cosine in the 1660s; Euler, in his Introductio in analysin infinitorum (1748), made the exponential function central and wrote down eix=cos⁡x+isin⁡xe^{ix} = \cos x + i\sin x. Cauchy's 1821 Cours d'analyse gave the radius of convergence via what is now the root test, and Hadamard rediscovered the formula 1/lim sup⁡∣cn∣1/n1/\limsup|c_n|^{1/n} in 1888. Abel's theorem dates from 1826. Cauchy's flat function appeared in 1823. The matrix exponential is implicit in 19th-century work on linear differential equations and in Sophus Lie's theory of continuous groups (1870s onwards).

Recall Where we stand

A power series converges on an interval (in C\mathbb{C}, a disc) determined by the root test, uniformly on smaller closed intervals, and can be differentiated term by term. The exponential is defined by its series; f′=cff' = cf forces ff to be exponential; exp⁡\exp turns sums into products and has the logarithm as its inverse; and eiθ=cos⁡θ+isin⁡θe^{i\theta} = \cos\theta + i\sin\theta gives all of trigonometry. The radius of convergence is governed by singularities in the complex plane. The matrix exponential solves linear systems. Finally, e−1/x2e^{-1/x^2} is smooth but flat at 00, and from it come bumps and cutoffs, the tools for localising. 2B.7 Fourier Series and the First Heat Equation uses complex exponentials e2πikxe^{2\pi ikx} as building blocks for periodic functions, and solves the heat equation with them.

Exercises

Exercise 6.11 Radii of convergence

Find the radius of convergence of: (a) ∑n3xn\sum n^3x^n; (b) ∑xn2n+3n\sum \frac{x^n}{2^n + 3^n}; (c) ∑n! xn\sum n!\,x^n; (d) ∑x2n(2n)!\sum \frac{x^{2n}}{(2n)!}; (e) ∑xn2\sum x^{n^2}.

Solution

(a) 11. (b) 33, since (2n+3n)1/n→3(2^n + 3^n)^{1/n} \to 3. (c) 00. (d) ∞\infty (this is cosh⁡x\cosh x). (e) 11: the coefficients are 11 at perfect squares and 00 elsewhere, so lim sup⁡∣cn∣1/n=1\limsup|c_n|^{1/n} = 1.

Exercise 6.12 Two definitions of ee

Show that (1+xn)n→ex(1 + \frac xn)^n \to e^x for every real xx, by showing nlog⁡(1+xn)→xn\log(1 + \frac xn) \to x (use log⁡(1+u)=u+O(u2)\log(1 + u) = u + O(u^2), or the mean value theorem for log⁡\log). Deduce that lim⁡(1+1n)n=exp⁡(1)\lim(1 + \frac1n)^n = \exp(1), so the ee of 2A.6 Sequences is the ee of this chapter.

Exercise 6.13 Analytic functions are rigid

Let ff be real analytic on an open interval II, and suppose f=0f = 0 on some subinterval (c,d)⊆I(c, d) \subseteq I. Show that f=0f = 0 on II. (Let SS be the set of points of II near which ff vanishes identically. Show SS is open, non-empty and closed in II, the last because at a limit point of SS all derivatives of ff vanish, so its Taylor series there is 00. Then use 2B.4 Connectedness.) Explain why this means no analytic function can be a bump.

Solution

SS is open by definition and contains (c,d)(c, d). If a∈Ia \in I is a limit of points sk∈Ss_k \in S, then each f(n)f^{(n)} is continuous and vanishes at the sks_k, so f(n)(a)=0f^{(n)}(a) = 0 for all nn. Near aa, ff equals its Taylor series at aa, which is 00; so a∈Sa \in S. Thus SS is clopen in the connected interval II, and S=IS = I. A bump vanishes on an interval but not everywhere, so it can't be analytic.

Exercise 6.14 The smooth step

With ψ(x)=e−1/x\psi(x) = e^{-1/x} for x>0x > 0 and 00 otherwise, show that S(x)=ψ(x)ψ(x)+ψ(1−x)S(x) = \frac{\psi(x)}{\psi(x) + \psi(1 - x)} is smooth on R\mathbb{R}, 00 for x≤0x \leq 0, 11 for x≥1x \geq 1, and increasing on [0,1][0, 1].

Hint

For monotonicity, write S=11+ψ(1−x)/ψ(x)S = \frac{1}{1 + \psi(1-x)/\psi(x)} on (0,1)(0, 1) and check that ψ(1−x)/ψ(x)=exp⁡(1x−11−x)\psi(1 - x)/\psi(x) = \exp\big(\frac1x - \frac1{1-x}\big) is decreasing.

Exercise 6.15 Matrix exponentials

Compute etAe^{tA} for (a) A=(200−1)A = \begin{pmatrix}2 & 0\\0 & -1\end{pmatrix}; (b) A=(0100)A = \begin{pmatrix}0 & 1\\0 & 0\end{pmatrix}; (c) A=(a−bba)A = \begin{pmatrix}a & -b\\ b & a\end{pmatrix}. Describe the solutions of x′=Axx' = Ax in each case. Then check that eAeB≠eA+Be^A e^B \neq e^{A + B} for A=(0100)A = \begin{pmatrix}0 & 1\\0 & 0\end{pmatrix} and B=(0010)B = \begin{pmatrix}0 & 0\\1 & 0\end{pmatrix} (compute eA+Be^{A+B} using (A+B)2=I(A + B)^2 = I).

Solution

(a) diag(e2t,e−t)\mathrm{diag}(e^{2t}, e^{-t}): growth along the first axis, decay along the second (a saddle). (b) A2=0A^2 = 0, so etA=I+tA=(1t01)e^{tA} = I + tA = \begin{pmatrix}1 & t\\0 & 1\end{pmatrix}: shear, growing only linearly. (c) A=aI+bJA = aI + bJ with aIaI and bJbJ commuting, so etA=eat(cos⁡bt−sin⁡btsin⁡btcos⁡bt)e^{tA} = e^{at}\begin{pmatrix}\cos bt & -\sin bt\\ \sin bt & \cos bt\end{pmatrix}: spirals, outward if a>0a > 0, inward if a<0a < 0. Finally, eAeB=(1101)(1011)=(2111)e^Ae^B = \begin{pmatrix}1&1\\0&1\end{pmatrix}\begin{pmatrix}1&0\\1&1\end{pmatrix} = \begin{pmatrix}2 & 1\\1 & 1\end{pmatrix}, while eA+B=cosh⁡1 I+sinh⁡1 (A+B)=(cosh⁡1sinh⁡1sinh⁡1cosh⁡1)e^{A+B} = \cosh 1\,I + \sinh 1\,(A + B) = \begin{pmatrix}\cosh 1 & \sinh 1\\ \sinh 1 & \cosh 1\end{pmatrix}.

Exercise 6.16 Determinant of an exponential

Show that det⁡eA=etr⁡A\det e^A = e^{\operatorname{tr}A} when AA is diagonalisable (write A=PDP−1A = PDP^{-1} and note eA=PeDP−1e^A = Pe^DP^{-1}). Deduce that eAe^A always has positive determinant when AA is diagonalisable. (It holds for every AA, by the density of diagonalisable matrices; compare 2B.4 Connectedness's exercise on GLnGL_n.)

Exercise 6.17 Rehearsal: cutoffs at scale ρ\rho

Let χ\chi be the cutoff of this chapter, with ∣χ′∣≤C1|\chi'| \leq C_1 and ∣χ′′∣≤C2|\chi''| \leq C_2. For ρ>0\rho > 0, let χρ(x)=χ(∣x∣/ρ)\chi_\rho(x) = \chi(|x|/\rho) on Rn\mathbb{R}^n. (a) Show that χρ=1\chi_\rho = 1 on the ball of radius ρ\rho, χρ=0\chi_\rho = 0 outside radius 2ρ2\rho, and that its first and second partial derivatives are bounded by C1′/ρC_1'/\rho and C2′/ρ2C_2'/\rho^2 for constants not depending on ρ\rho. (b) If uu is a function with ∫B(0,2ρ)∣∇u∣2≤A\int_{B(0, 2\rho)}|\nabla u|^2 \leq A, show that ∫∣∇(χρu)∣2≤2A+2C1′2ρ2∫B(0,2ρ)u2\int|\nabla(\chi_\rho u)|^2 \leq 2A + \frac{2C_1'^2}{\rho^2}\int_{B(0, 2\rho)} u^2. This trade, a cutoff at scale ρ\rho costing a factor ρ−2\rho^{-2} on the lower-order term, is exactly the bookkeeping in the localised log-Sobolev and noncollapsing arguments of 12A.4 κ-Noncollapsing, where ρ\rho is the scale at which the curvature is controlled.

Solution

(a) χρ(x)=1\chi_\rho(x) = 1 when ∣x∣/ρ≤1|x|/\rho \leq 1 and 00 when ∣x∣/ρ≥2|x|/\rho \geq 2. The function is smooth: near 00 it is identically 11, and away from 00, ∣x∣|x| is smooth. By the chain rule, ∂iχρ=χ′(∣x∣/ρ)xiρ∣x∣\partial_i\chi_\rho = \chi'(|x|/\rho)\frac{x_i}{\rho|x|}, bounded by C1/ρC_1/\rho; the second derivatives involve χ′′/ρ2\chi''/\rho^2 and χ′/(ρ∣x∣)\chi'/(\rho|x|), and the latter is only non-zero for ∣x∣≥ρ|x| \geq \rho, so it is at most C1/ρ2C_1/\rho^2. (b) ∇(χρu)=χρ∇u+u∇χρ\nabla(\chi_\rho u) = \chi_\rho\nabla u + u\nabla\chi_\rho, and ∣a+b∣2≤2∣a∣2+2∣b∣2|a + b|^2 \leq 2|a|^2 + 2|b|^2, with 0≤χρ≤10 \leq \chi_\rho \leq 1 supported in B(0,2ρ)B(0, 2\rho).

© 2026 NeckPinch (www.neckpinch.com). All content in the guidebook (text, mathematics, figures and exercises) is protected by copyright. All rights reserved. No part may be copied, republished or redistributed without written permission.