Mathematics · Book 5 · Bachelor Year 3

University Mathematics — Year 3

University Mathematics — Year 3 · Bachelor Year 3

11Product Measures, Fubini, Change of Variables

One-dimensional Lebesgue theory becomes multi-dimensional calculus through two theorems. Tonelli–Fubini says that integrals over products are iterated integrals — slicing is legitimate, in either order, under hypotheses one can actually check. The change of variables formula transports integrals along C1\mathcal C^1 diffeomorphisms, with the Jacobian determinant as the exchange rate for volume; we prove it completely, starting from the linear case where it explains what the determinant is. Applications cascade: the layer cake formula, convolution, polar coordinates, the volume of the nn-ball — and, in the weekend problem, Stirling’s formula with an honest error analysis.

11.1 Product σ\sigma-algebras and product measures

Definition 11.1

For measurable spaces (X,A)(X, \mathcal A), (Y,B)(Y, \mathcal B), the product σ\sigma-algebra AB\mathcal A \otimes \mathcal B on X×YX \times Y is generated by the rectangles A×BA \times B (AAA \in \mathcal A, BBB \in \mathcal B) — a π\pi-system. For EX×YE \subseteq X\times Y and xXx \in X, the section is Ex={y:(x,y)E}E_x = \{y : (x,y) \in E\}; for a function ff on the product, fx=f(x,)f_x = f(x, \cdot).

Proposition 11.2

(a) If EABE \in \mathcal A\otimes\mathcal B, every section ExBE_x \in \mathcal B (and symmetrically); if ff is AB\mathcal A\otimes\mathcal B-measurable, every fxf_x is B\mathcal B-measurable. (b) B(Rm)B(Rn)=B(Rm+n)\mathcal B(\R^m)\otimes\mathcal B(\R^n) = \mathcal B(\R^{m+n}).

Proof. (a) Good sets: {E:ExB x}\{E : E_x \in \mathcal B\ \forall x\} is a σ\sigma-algebra (sections commute with complements and countable unions) containing the rectangles. For ff: (fx)1(B)=(f1(B))x(f_x)^{-1}(B) = (f^{-1}(B))_x. (b) (\subseteq) Rectangles of Borel sets: it suffices that open×\timesopen boxes are Borel in Rm+n\R^{m+n} (they are open) and that general Borel rectangles are limits — good sets again: {A:A×RnB(Rm+n)}\{A : A\times\R^n \in \mathcal B(\R^{m+n})\} is a σ\sigma-algebra containing the opens; intersect two such. (\supseteq) Every open set of Rm+n\R^{m+n} is a countable union of rational open boxes U×VU\times V: contained in the product σ\sigma-algebra.

Theorem 11.3 (Product measure)

Let (X,A,μ)(X, \mathcal A, \mu) and (Y,B,ν)(Y, \mathcal B, \nu) be σ\sigma-finite. For every EABE \in \mathcal A\otimes\mathcal B, the function xν(Ex)x \mapsto \nu(E_x) is measurable, and

(μν)(E)=Xν(Ex) ⁣dμ(x)(\mu\otimes\nu)(E) = \int_X \nu(E_x)\,\dd\mu(x)

defines the unique measure on AB\mathcal A\otimes\mathcal B with (μν)(A×B)=μ(A)ν(B)(\mu\otimes\nu)(A\times B) = \mu(A)\nu(B). It is σ\sigma-finite, and symmetric: the same measure is obtained by integrating xx-sections against ν\nu.

Proof. Measurability of xν(Ex)x \mapsto \nu(E_x). First let ν\nu be finite. The class D\mathcal D of EE for which the map is measurable contains the rectangles (ν((A×B)x)=ν(B)1A(x)\nu((A\times B)_x) = \nu(B)\mathbf 1_A(x)) and is a λ\lambda-system: for EFE \subseteq F in D\mathcal D, ν((FE)x)=ν(Fx)ν(Ex)\nu((F\setminus E)_x) = \nu(F_x) - \nu(E_x) (finiteness); for EnEE_n \uparrow E, ν((En)x)ν(Ex)\nu((E_n)_x) \uparrow \nu(E_x) (continuity from below), and monotone limits of measurable functions are measurable. Rectangles form a π\pi-system: Dynkin (Theorem 9.4) gives D=AB\mathcal D = \mathcal A\otimes\mathcal B. If ν\nu is σ\sigma-finite, write Y=YkY = \bigcup Y_k, YkY_k \uparrow, ν(Yk)<\nu(Y_k) < \infty: ν(Ex)=limkνk(Ex)\nu(E_x) = \lim_k\nu_k(E_x) with νk=ν(Yk)\nu_k = \nu(\cdot\cap Y_k) finite.

Measure. σ\sigma-additivity of Eν(Ex) ⁣dμE \mapsto \int\nu(E_x)\dd\mu follows from Corollary 10.7 (sections of disjoint sets are disjoint). On rectangles it gives μ(A)ν(B)\mu(A)\nu(B). Uniqueness: two candidates agree on the π\pi-system of rectangles; σ\sigma-finiteness provides rectangles Xk×YkX×YX_k\times Y_k \uparrow X\times Y of finite measure: Theorem 9.7. Symmetry: the other-order construction is also a measure agreeing on rectangles — unique, hence the same.

Definition 11.4

Lebesgue measure on Rd\R^d is λd=λλ\lambda_d = \lambda\otimes\cdots\otimes\lambda (dd factors; associativity of the construction is checked on boxes and propagated by uniqueness). It is the unique Borel measure giving each box (ai,bi]\prod\intoc{a_i}{b_i} its volume (biai)\prod(b_i - a_i); it is translation-invariant (translates agree on boxes), σ\sigma-finite, and complete after Carathéodory completion — we write λd\lambda_d for the completed measure and integrate accordingly.

11.2 Tonelli and Fubini

Theorem 11.5 (Tonelli)

μ,ν\mu, \nu σ\sigma-finite, f ⁣:X×Y[0,+]f \colon X\times Y \to [0, +\infty] measurable. Then xYfx ⁣dνx \mapsto \int_Y f_x\,\dd\nu is measurable and

X×Yf ⁣d(μν)=X(Yf(x,y) ⁣dν(y)) ⁣dμ(x)=Y(Xf(x,y) ⁣dμ(x)) ⁣dν(y).\int_{X\times Y}f\,\dd(\mu\otimes\nu) = \int_X\Bigl(\int_Y f(x,y)\,\dd\nu(y)\Bigr)\dd\mu(x) = \int_Y\Bigl(\int_X f(x,y)\,\dd\mu(x)\Bigr)\dd\nu(y).

Proof. The standard machine. For f=1Ef = \mathbf 1_E this is Theorem 11.3 (and its symmetric form). By linearity it holds for simple f0f \geq 0. For general f0f \geq 0: take simple snfs_n \nearrow f (Theorem 10.4); then Y(sn)x ⁣dνYfx ⁣dν\int_Y(s_n)_x \dd\nu \nearrow \int_Y f_x\dd\nu for each xx (MCT in YY), so the left members converge by MCT in XX, while sn ⁣d(μν)f\int s_n\,\dd(\mu\otimes\nu) \nearrow \int f by MCT on the product.

Theorem 11.6 (Fubini)

μ,ν\mu, \nu σ\sigma-finite, fL1(μν)f \in L^1(\mu\otimes\nu). Then for μ\mu-a.e. xx the section fxf_x is ν\nu-integrable, the a.e.-defined function xfx ⁣dνx \mapsto \int f_x\dd\nu is integrable, and the two iterated integrals both equal f ⁣d(μν)\int f\,\dd(\mu\otimes\nu).

Proof. Tonelli applied to f\abs f shows φ(x)=fx ⁣dν\varphi(x) = \int\abs{f_x} \dd\nu has finite integral, hence is finite a.e.: fxL1(ν)f_x \in L^1(\nu) for a.e. xx. Split f=f+ff = f^+ - f^- (real case; complex by components): Tonelli computes each iterated integral of f±f^\pm as f± ⁣d(μν)<\int f^\pm\dd(\mu\otimes\nu) < \infty, and the a.e.-defined difference integrates to the difference. Symmetrically for the other order.

Method 11.7

To interchange two integrals (or an integral and a sum, or two sums): if the integrand is nonnegative, interchange freely (Tonelli). Otherwise, first apply Tonelli to f\abs f in whichever order is easier to estimate; if the result is finite, Fubini legitimizes the interchange. Never skip the f\abs f check: Exercise 11.4’s integrand has two iterated integrals with different values.

Proposition 11.8 (Layer cake)

For f0f \geq 0 measurable on (X,A,μ)(X, \mathcal A, \mu) σ\sigma-finite:

Xf ⁣dμ=0+μ({f>t}) ⁣dt,Xfp ⁣dμ=p0+tp1μ({f>t}) ⁣dt(p1).\int_X f\,\dd\mu = \int_0^{+\infty}\mu(\{f > t\})\,\dd t, \qquad \int_X f^p\,\dd\mu = p\int_0^{+\infty}t^{p-1}\mu(\{f > t\})\,\dd t \quad (p \geq 1).

Proof. Apply Tonelli to 1{(x,t):0<t<f(x)}\mathbf 1_{\{(x,t) : 0 < t < f(x)\}} on X×(0,+)X \times \intoo0{+\infty} (measurable: it is {(x,t):f(x)t>0}{t>0}\{(x,t): f(x) - t > 0\}\cap\{t > 0\}, a Borel-type combination of the measurable (x,t)f(x)t(x,t)\mapsto f(x) - t): integrating in tt first gives f ⁣dμ\int f\,\dd\mu; in xx first, 0μ(f>t) ⁣dt\int_0^\infty\mu(f > t)\dd t. For fpf^p: substitute t=spt = s^p in μ(fp>t) ⁣dt\int\mu(f^p > t) \dd t, i.e. apply the first formula to fpf^p and change variables in the one-dimensional integral ({fp>sp}={f>s}\{f^p > s^p\} = \{f > s\}).

Theorem 11.9 (Convolution on L1L^1)

For f,gL1(Rd,λd)f, g \in L^1(\R^d, \lambda_d), the integral

(fg)(x)=Rdf(xy)g(y) ⁣dy(f * g)(x) = \int_{\R^d} f(x - y)\,g(y)\,\dd y

converges absolutely for a.e. xx, defines fgL1(Rd)f * g \in L^1(\R^d) with fg1f1g1\norm{f*g}_1 \leq \norm f_1\norm g_1, and * is commutative and associative.

Proof. (x,y)f(xy)g(y)(x, y) \mapsto f(x-y)g(y) is measurable ((x,y)xy(x,y)\mapsto x - y is continuous; compose and multiply). Tonelli:

 ⁣ ⁣f(xy)g(y) ⁣dy ⁣dx=g(y)(f(xy) ⁣dx) ⁣dy=f1g1<\int\!\!\int \abs{f(x-y)}\abs{g(y)}\,\dd y\,\dd x = \int\abs{g(y)}\Bigl(\int\abs{f(x - y)}\dd x\Bigr)\dd y = \norm f_1\norm g_1 < \infty

(translation invariance of λd\lambda_d in the inner integral). So the double integral is finite; Fubini gives a.e. absolute convergence and the norm bound fg1f1g1\norm{f*g}_1 \leq \norm f_1\norm g_1. Commutativity: substitute yxyy \mapsto x - y (translation and reflection invariance — reflection invariance holds on boxes, hence everywhere by uniqueness). Associativity: Tonelli–Fubini on a triple integral.

11.3 Change of variables

Theorem 11.10 (Linear change of variables)

For TGLd(R)T \in GL_d(\R) and AB(Rd)A \in \mathcal B(\R^d): λd(T(A))=detTλd(A)\lambda_d(T(A)) = \abs{\det T}\,\lambda_d(A); consequently f(y) ⁣dy=detTf(Tx) ⁣dx\int f(y)\dd y = \abs{\det T}\int f(Tx)\,\dd x for f0f \geq 0 or integrable.

Proof. The measure μT(A)=λd(T(A))\mu_T(A) = \lambda_d(T(A)) is a Borel measure (homeomorphisms preserve Borel sets, Problem 9.1), translation-invariant (T(A+x)=T(A)+TxT(A + x) = T(A) + Tx), finite on the unit box: by the characterization of Lebesgue measure (Exercise 9.6, whose proof works verbatim in Rd\R^d with dyadic cubes), μT=c(T)λd\mu_T = c(T)\lambda_d with c(T)=λd(T([0,1)d))c(T) = \lambda_d(T(\intco01^d)). The map Tc(T)T \mapsto c(T) is multiplicative (c(ST)=c(S)c(T)c(ST) = c(S)c(T), by composing), so it suffices to compute cc on generators of GLdGL_d: elementary matrices. Diagonal diag(a,1,,1)\operatorname{diag}(a, 1, \dots, 1): maps the unit cube to a box of volume a\abs a: c=a=detc = \abs a = \abs\det. Transposition of coordinates: permutes the cube: c=1=detc = 1 = \abs\det. Transvection T(x)=x+αx2e1T(x) = x + \alpha x_2e_1: the image of the unit cube is a sheared prism; by Tonelli its measure is λ1(section) ⁣dx2 ⁣dxd=1\int\lambda_1(\text{section})\dd x_2 \cdots \dd x_d = 1, each x1x_1-section being an interval of length 11: c=1=detc = 1 = \abs{\det}. Every invertible matrix is a product of these (Gaussian elimination), and both cc and det\abs\det are multiplicative: c(T)=detTc(T) = \abs{\det T}. The integral formula follows by the standard machine (indicators, simple, MCT).

Theorem 11.11 (Change of variables)

Let U,VRdU, V \subseteq \R^d be open and Φ ⁣:UV\Phi \colon U \to V a C1\mathcal C^1 diffeomorphism. For every measurable f ⁣:V[0,+]f \colon V \to [0, +\infty] (or fL1(V)f \in L^1(V)):

Vf(y) ⁣dy=Uf(Φ(x))detDΦ(x) ⁣dx.\int_V f(y)\,\dd y = \int_U f\bigl(\Phi(x)\bigr)\,\abs{\det D\Phi(x)}\,\dd x .

Proof. Write J(x)=detDΦ(x)J(x) = \abs{\det D\Phi(x)}. The heart of the proof is the inequality

λd(Φ(A))AJ ⁣dλdfor every Borel AU;()\lambda_d\bigl(\Phi(A)\bigr) \leq \int_A J\,\dd\lambda_d \qquad\text{for every Borel } A \subseteq U; \tag{$*$}

Step 4 below upgrades ()(*) — applied to both Φ\Phi and Φ1\Phi^{-1} — to the equality of the theorem. Note that Φ1\Phi^{-1} is itself a C1\mathcal C^1 diffeomorphism with Jacobian detDΦ1(y)=J(Φ1y)1\abs{\det D\Phi^{-1}(y)} = J(\Phi^{-1}y)^{-1} (chain rule on ΦΦ1=id\Phi\circ\Phi^{-1} = \mathrm{id}).

Step 1: ()(*) for cubes with a distortion factor. Fix a closed cube QUQ \subseteq U of center x0x_0 and side 2r2r (sup-norm ball). Claim: for every ε>0\varepsilon > 0, if Φ\Phi is differentiable on QQ with DΦ(x)DΦ(x0)ε\norm{D\Phi(x) - D\Phi(x_0)} \leq \varepsilon on QQ (operator norm for the sup-norm), then

Φ(Q)Φ(x0)+DΦ(x0)((1+εDΦ(x0)1)(Qx0)),\Phi(Q) \subseteq \Phi(x_0) + D\Phi(x_0)\Bigl(\,\bigl(1 + \varepsilon\norm{D\Phi(x_0)^{-1}}\bigr)\,(Q - x_0)\Bigr),

because for xQx \in Q, the mean value inequality applied to Φ(x)Φ(x0)DΦ(x0)(xx0)\Phi(x) - \Phi(x_0) - D\Phi(x_0)(x - x_0) gives Φ(x)Φ(x0)DΦ(x0)(xx0)εxx0εr\norm{\Phi(x) - \Phi(x_0) - D\Phi(x_0)(x-x_0)}_\infty \leq \varepsilon\norm{x - x_0}_\infty \leq \varepsilon r, and DΦ(x0)1D\Phi(x_0)^{-1} pulls this defect into an εDΦ(x0)1r\varepsilon\norm{D\Phi(x_0)^{-1}}\,r-enlargement of the cube. By Theorem 11.10,

λd(Φ(Q))detDΦ(x0)(1+εC)dλd(Q),C=supQDΦ()1.\lambda_d(\Phi(Q)) \leq \abs{\det D\Phi(x_0)}\, \bigl(1 + \varepsilon\,C\bigr)^{d}\,\lambda_d(Q), \qquad C = \sup_{Q}\norm{D\Phi(\cdot)^{-1}} .

Step 2: ()(*) for compact cubes, by subdivision. Let QUQ \subseteq U be a compact cube and ε>0\varepsilon > 0. On QQ, DΦD\Phi is uniformly continuous and DΦ1\norm{D\Phi^{-1}} bounded (compactness); subdivide QQ into 2kd2^{kd} subcubes QiQ_i small enough that the oscillation of DΦD\Phi on each is ε\leq \varepsilon. Step 1 on each subcube (center xix_i):

λd(Φ(Q))iλd(Φ(Qi))(1+Cε)didetDΦ(xi)λd(Qi)(1+Cε)d(QJ+ε),\lambda_d(\Phi(Q)) \leq \sum_i\lambda_d(\Phi(Q_i)) \leq (1 + C\varepsilon)^d \sum_i \abs{\det D\Phi(x_i)}\,\lambda_d(Q_i) \leq (1 + C\varepsilon)^d\Bigl(\int_Q J + \varepsilon'\Bigr),

the last step because idetDΦ(xi)1QiJ\sum_i\abs{\det D\Phi(x_i)}\mathbf 1_{Q_i} \to J uniformly on QQ (continuity of detDΦ\det D\Phi) — Riemann-sum comparison. Let ε0\varepsilon \to 0: ()(*) holds for compact cubes.

Step 3: ()(*) for all Borel AA. The set function Aλd(Φ(A))A \mapsto \lambda_d(\Phi(A)), on Borel subsets of UU, is a measure (Φ\Phi is a bijection onto VV preserving Borel sets and countable disjointness), and so is AAJA \mapsto \int_AJ. Every open subset of UU is a countable union of almost-disjoint dyadic compact cubes (standard dyadic decomposition: take maximal dyadic cubes contained in the open set), and both measures are additive across them (boundaries of cubes are λd\lambda_d-null, and their Φ\Phi-images are null by Step 2 applied to thin cube-coverings of the faces): ()(*) passes from cubes to open sets. General Borel AA: exhaust UU by compacts KmUK_m \uparrow U with KmK˚m+1K_m \subseteq \mathring K_{m+1}, and fix mm; on K˚m+1\mathring K_{m+1}, JJ is bounded by some MmM_m. By outer regularity of λd\lambda_d (proof as in Theorem 9.13, with boxes), choose open sets OnO_n with AKmOnK˚m+1A \cap K_m \subseteq O_n \subseteq \mathring K_{m+1} and λd(On(AKm))0\lambda_d\bigl(O_n \setminus (A\cap K_m)\bigr) \to 0. Then

λd(Φ(AKm))λd(Φ(On))OnJAKmJ+Mmλd(On(AKm))nAKmJ.\lambda_d\bigl(\Phi(A\cap K_m)\bigr) \leq \lambda_d\bigl(\Phi(O_n)\bigr) \leq \int_{O_n}J \leq \int_{A\cap K_m}J + M_m\,\lambda_d\bigl(O_n\setminus(A\cap K_m)\bigr) \xrightarrow[n\to\infty]{} \int_{A\cap K_m}J .

Let mm \to \infty: continuity from below on the left, MCT on the right. This establishes ()(*).

Step 4: equality and the integral formula. First extend ()(*) from sets to integrals: for every measurable g0g \geq 0 on VV,

Vg(y) ⁣dyUg(Φ(x))J(x) ⁣dx.()\int_V g(y)\,\dd y \leq \int_U g(\Phi(x))\,J(x)\,\dd x . \tag{$**$}

Indeed, for g=1Bg = \mathbf 1_B this is ()(*) with A=Φ1(B)A = \Phi^{-1}(B); linearity extends it to simple gg, and MCT to all g0g \geq 0 (the standard machine). Now apply ()(**) twice: first to gg, then — for the diffeomorphism Φ1\Phi^{-1} — to the function xg(Φ(x))J(x)x \mapsto g(\Phi(x))J(x):

VgUg(Φ(x))J(x) ⁣dxVg(y)J(Φ1y)detDΦ1(y) ⁣dy=Vg,\int_Vg \leq \int_U g(\Phi(x))J(x)\dd x \leq \int_V g(y)\,J(\Phi^{-1}y)\,\abs{\det D\Phi^{-1}(y)}\,\dd y = \int_V g ,

since J(Φ1y)detDΦ1(y)=det(DΦ(Φ1y)DΦ1(y))=1J(\Phi^{-1}y)\abs{\det D\Phi^{-1}(y)} = \abs{\det\bigl( D\Phi(\Phi^{-1}y)\,D\Phi^{-1}(y)\bigr)} = 1 (chain rule on ΦΦ1=id\Phi\circ\Phi^{-1} = \mathrm{id}). All inequalities are equalities: the formula holds for g0g \geq 0, and for L1L^1 functions by decomposition.

Example 11.12 (Polar coordinates; the Gaussian again)

Φ(r,θ)=(rcosθ,rsinθ)\Phi(r, \theta) = (r\cos\theta, r\sin\theta) is a C1\mathcal C^1 diffeomorphism from (0,+)×(0,2π)\intoo0{+\infty}\times\intoo0{2\pi} onto R2\R^2 minus a half-line (null set), with detDΦ=r\det D\Phi = r:

R2f(x,y) ⁣dx ⁣dy=02π ⁣ ⁣0+f(rcosθ,rsinθ)r ⁣dr ⁣dθ.\int_{\R^2}f(x, y)\,\dd x\,\dd y = \int_0^{2\pi}\!\!\int_0^{+\infty} f(r\cos\theta, r\sin\theta)\,r\,\dd r\,\dd\theta .

For f=ex2y2f = \eu^{-x^2-y^2}, Tonelli and this formula give

G2=(Rex2 ⁣dx)2=R2ex2y2=2π0rer2 ⁣dr=π:G^2 = \Bigl(\int_\R \eu^{-x^2}\dd x\Bigr)^2 = \int_{\R^2}\eu^{-x^2-y^2} = 2\pi\int_0^\infty r\eu^{-r^2}\dd r = \pi:

the classical two-line proof of G=πG = \sqrt\pi, now fully justified (compare the parameter proof of Problem 10.1).

Theorem 11.13 (Volume of the unit ball)

Let vd=λd(B(0,1))v_d = \lambda_d(B(0,1)) in Rd\R^d. Then

vd=πd/2Γ(d2+1):v1=2,v2=π,v3=4π3,v4=π22, v_d = \frac{\pi^{d/2}}{\Gamma\bigl(\frac d2 + 1\bigr)} : \qquad v_1 = 2,\quad v_2 = \pi,\quad v_3 = \tfrac{4\pi}3,\quad v_4 = \tfrac{\pi^2}2,\ \dots

Proof. Compute I=Rdex22 ⁣dλdI = \int_{\R^d}\eu^{-\norm x_2^2}\dd\lambda_d twice. By Tonelli it factors: I=Gd=πd/2I = G^d = \pi^{d/2}. By the layer cake formula (Proposition 11.8) with f=ex2f = \eu^{- \norm x^2}, whose level sets are balls: {f>t}=B(0,lnt)\{f > t\} = B\bigl(0, \sqrt{-\ln t}\bigr) for 0<t<10 < t < 1, of measure vd(lnt)d/2v_d(-\ln t)^{d/2} (dilation by ρ\rho scales λd\lambda_d by ρd\rho^d: Theorem 11.10), so

I=01vd(lnt)d/2 ⁣dt=t=esvd0sd/2es ⁣ds=vdΓ(d2+1).I = \int_0^1 v_d\,(-\ln t)^{d/2}\,\dd t \overset{t = \eu^{-s}}{=} v_d\int_0^\infty s^{d/2}\eu^{-s}\,\dd s = v_d\,\Gamma\Bigl(\frac d2 + 1\Bigr).

Equate. (The values: Γ(32)=π2\Gamma(\frac32) = \frac{\sqrt\pi}2, Γ(2)=1\Gamma(2) = 1, etc.) Note vd0v_d \to 0 as dd \to \infty — the weekend problem quantifies how fast, via Stirling.

11.4 Exercises

Exercise 11.1

Let μ\mu be counting measure on ([0,1],B([0,1]))(\intcc01, \mathcal B(\intcc01)) (not σ\sigma-finite) and λ\lambda Lebesgue measure, and let Δ={(x,x)}\Delta = \{(x,x)\} be the diagonal in [0,1]2\intcc01^2. Show that Δ\Delta is measurable, and compute the two iterated integrals of 1Δ\mathbf 1_\Delta against λ\lambda and μ\mu: they differ. Which hypothesis of Theorem 11.5 fails?

Solution

Solution of Exercise 11.1.

Δ\Delta is closed in [0,1]2\intcc01^2, hence Borel, and B([0,1]2)\mathcal B(\intcc01^2) is the product σ\sigma-algebra (Proposition 11.2(b)). Iterating one way:

[0,1](1Δ(x,y) ⁣dλ(y)) ⁣dμ(x)=λ({x}) ⁣dμ(x)=0;\int_{\intcc01}\Bigl(\int \mathbf 1_\Delta(x,y) \,\dd\lambda(y)\Bigr)\dd\mu(x) = \int \lambda(\{x\})\,\dd\mu(x) = 0 ;

the other way:

[0,1](1Δ(x,y) ⁣dμ(x)) ⁣dλ(y)=μ({y}) ⁣dλ(y)=1 ⁣dλ=1.\int_{\intcc01}\Bigl(\int\mathbf 1_\Delta(x,y)\,\dd\mu(x)\Bigr)\dd\lambda(y) = \int \mu(\{y\})\,\dd\lambda(y) = \int 1\,\dd\lambda = 1 .

The failing hypothesis is σ\sigma-finiteness of the counting measure μ\mu on the uncountable [0,1]\intcc01: no countable family of finite-μ\mu sets covers it.

Exercise 11.2

Justify the interchange and re-derive Dirichlet’s integral: for A>0A > 0,

0Asinxx ⁣dx=0A ⁣ ⁣0+exysinx ⁣dy ⁣dx=0+ ⁣ ⁣0Aexysinx ⁣dx ⁣dy,\int_0^A\frac{\sin x}x\,\dd x = \int_0^A\!\!\int_0^{+\infty}\eu^{-xy}\sin x\,\dd y\,\dd x = \int_0^{+\infty}\!\!\int_0^A \eu^{-xy}\sin x\,\dd x\,\dd y,

compute the inner integral in closed form, and let A+A \to +\infty (dominate the yy-integral) to get 0sinxx ⁣dx=π2\int_0^\infty\frac{\sin x}x\dd x = \frac\pi2.

Solution

Solution of Exercise 11.2.

On [0,A]×(0,+)\intcc0A\times\intoo0{+\infty}: 0A0exysinx ⁣dy ⁣dx=0Asinxx ⁣dxA<\int_0^A\int_0^\infty\eu^{-xy}\abs{\sin x}\,\dd y\,\dd x = \int_0^A\frac{\abs{\sin x}}x\dd x \leq A < \infty (Tonelli for the absolute value): Fubini applies, and since 0exy ⁣dy=1x\int_0^\infty\eu^{-xy}\dd y = \frac1x,

0Asinxx ⁣dx=0(0Aexysinx ⁣dx) ⁣dy=01eAy(cosA+ysinA)1+y2 ⁣dy\int_0^A\frac{\sin x}x\dd x = \int_0^\infty\Bigl(\int_0^A\eu^{-xy}\sin x\,\dd x\Bigr)\dd y = \int_0^\infty \frac{1 - \eu^{-Ay}(\cos A + y\sin A)}{1 + y^2}\,\dd y

(the inner integral: Im0Ae(iy)x ⁣dx\operatorname{Im}\int_0^A\eu^{(\iu - y)x}\dd x, computed directly). As AA \to \infty, the correction term is bounded by 0eAy1+y1+y2 ⁣dy320eAy ⁣dy=32A0\int_0^\infty\eu^{-Ay}\frac{1 + y}{1 + y^2}\dd y \leq \frac32\int_0^\infty\eu^{-Ay}\dd y = \frac3{2A} \to 0; the main term is 0 ⁣dy1+y2=π2\int_0^\infty\frac{\dd y}{1+y^2} = \frac\pi2. Hence 0sinxx ⁣dx=π2\int_0^\infty\frac{\sin x}x\dd x = \frac\pi2 — Dirichlet’s integral by Fubini.

Exercise 11.3 ★★

(a) Prove that for f0f \geq 0 measurable and μ\mu finite: n1μ({fn})f ⁣dμμ(X)+n1μ({fn})\sum_{n\geq1}\mu(\{f \geq n\}) \leq \int f\,\dd\mu \leq \mu(X) + \sum_{n\geq1}\mu(\{f\geq n\}): integrability is summability of the tail measures. (b) Deduce that fL1(μ)f \in L^1(\mu) (μ\mu finite) iff nμ(fn)<\sum_n\mu(\abs f \geq n) < \infty.

Solution

Solution of Exercise 11.3.

(a) Layer cake (Proposition 11.8): f ⁣dμ=0μ(f>t) ⁣dt\int f\,\dd\mu = \int_0^\infty\mu(f > t)\,\dd t, and tμ(f>t)t \mapsto \mu(f > t) is nonincreasing. On [n1,n][n-1, n]: μ(fn)μ(f>t)μ(f>n1)μ(fn1)\mu(f \geq n) \leq \mu(f > t) \leq \mu(f > n - 1) \leq \mu(f \geq n - 1); summing the integrals over the unit intervals:

n1μ(fn)f ⁣dμn1μ(fn1)=μ(f0)+n1μ(fn)μ(X)+n1μ(fn).\sum_{n\geq1}\mu(f \geq n) \leq \int f\,\dd\mu \leq \sum_{n\geq1}\mu(f \geq n - 1) = \mu(f \geq 0) + \sum_{n\geq1}\mu(f\geq n) \leq \mu(X) + \sum_{n\geq1}\mu(f\geq n).

(b) Apply (a) to f\abs f: finiteness of the integral and of the series are equivalent (the extra μ(X)\mu(X) is finite).

Exercise 11.4 ★★

For f(x,y)=x2y2(x2+y2)2f(x, y) = \dfrac{x^2 - y^2}{(x^2 + y^2)^2} on (0,1)2\intoo01^2, show

01 ⁣ ⁣01f ⁣dy ⁣dx=π4,01 ⁣ ⁣01f ⁣dx ⁣dy=π4\int_0^1\!\!\int_0^1 f\,\dd y\,\dd x = \frac\pi4, \qquad \int_0^1\!\!\int_0^1 f\,\dd x\,\dd y = -\frac\pi4

(note f=y(yx2+y2)f = \partial_y\bigl(\frac{y}{x^2+y^2}\bigr)), and verify directly that  ⁣f=+\int\!\int\abs f = +\infty: Fubini’s integrability hypothesis is not decorative.

Solution

Solution of Exercise 11.4.

Since f(x,y)=y(yx2+y2)f(x,y) = \partial_y\bigl(\frac{y}{x^2+y^2}\bigr) for x0x \ne 0:

01f(x,y) ⁣dy=1x2+1  01 ⁣ ⁣01f ⁣dy ⁣dx=01 ⁣dx1+x2=π4;\int_0^1 f(x, y)\,\dd y = \frac{1}{x^2 + 1} \ \Longrightarrow\ \int_0^1\!\!\int_0^1 f\,\dd y\,\dd x = \int_0^1\frac{\dd x}{1 + x^2} = \frac\pi4 ;

by the antisymmetry f(y,x)=f(x,y)f(y,x) = -f(x,y), the other order gives π4-\frac\pi4. Absolute values: for 0<y<x0 < y < x,

0xf(x,y) ⁣dy=[yx2+y2]0x=12x,and f0 there, so01 ⁣ ⁣01f01 ⁣dx2x=+.\int_0^x f(x,y)\,\dd y = \Bigl[\frac{y}{x^2 + y^2}\Bigr]_0^x = \frac1{2x}, \quad\text{and } f \geq 0 \text{ there, so}\quad \int_0^1\!\!\int_0^1\abs f \geq \int_0^1\frac{\dd x}{2x} = +\infty .

No contradiction with Fubini: its hypothesis fL1f \in L^1 fails, and the two iterated integrals are simply two different numbers.

Exercise 11.5 ★★

(a) Compute 1[0,1]1[0,1]\mathbf 1_{\intcc01} * \mathbf 1_{\intcc01} explicitly (a tent function), and (111)(\mathbf 1 * \mathbf 1 * \mathbf 1)’s general shape. (b) Show supp(fg)suppf+suppg\operatorname{supp}(f * g) \subseteq \overline{\operatorname{supp}f + \operatorname{supp}g}. (c) Show that if fL1f \in L^1 and gg is bounded and continuous, fgf * g is continuous. (DCT via continuity of translation on the bounded gg.)

Solution

Solution of Exercise 11.5.

(a) (1[0,1]1[0,1])(x)=λ([0,1][x1,x])(\mathbf 1_{\intcc01}*\mathbf 1_{\intcc01})(x) = \lambda\bigl(\intcc01\cap\intcc{x-1}x\bigr): 00 for x[0,2]x \notin \intcc02, xx for 0x10 \leq x \leq 1, 2x2 - x for 1x21 \leq x \leq 2: the tent. Convolving again gives a C1\mathcal C^1 piecewise-quadratic bump on [0,3]\intcc03 (the quadratic B-spline): each convolution gains one degree of smoothness — the smoothing principle behind Chapter 12’s mollifiers.

(b) If xsuppf+suppgx \notin \overline{\operatorname{supp}f + \operatorname{supp}g}, there is a ball around xx disjoint from the sum set; for ysuppgy \in \operatorname{supp}g, xysuppfx - y \notin\operatorname{supp}f, so the integrand vanishes identically: fg=0f * g = 0 near xx.

(c) For xnxx_n \to x: (fg)(xn)=f(y)g(xny) ⁣dy(f*g)(x_n) = \int f(y)g(x_n - y)\,\dd y; the integrands converge pointwise (continuity of gg) and are dominated by gfL1\norm g_\infty\,\abs f \in L^1: DCT gives (fg)(xn)(fg)(x)(f*g)(x_n) \to (f*g)(x).

Exercise 11.6 ★★

(a) Show that the simplex Δd={x[0,)d:x1++xd1}\Delta_d = \{x \in \intco0\infty^d : x_1 + \dots + x_d \leq 1\} has volume 1d!\frac1{d!} (induction and Fubini). (b) Recover v2=πv_2 = \pi, v3=4π3v_3 = \frac{4\pi}3 from Theorem 11.13, and show λd(ellipsoid with semi-axes ai)=vdai\lambda_d(\text{ellipsoid with semi-axes } a_i) = v_d\prod a_i.

Solution

Solution of Exercise 11.6.

(a) By Fubini and induction, slicing along the last coordinate:

λd(Δd)=01λd1((1t)Δd1) ⁣dt=λd1(Δd1)01(1t)d1 ⁣dt=λd1(Δd1)d,\lambda_d(\Delta_d) = \int_0^1 \lambda_{d-1}\bigl((1 - t)\,\Delta_{d-1}\bigr)\,\dd t = \lambda_{d-1}(\Delta_{d-1})\int_0^1(1 - t)^{d-1}\dd t = \frac{\lambda_{d-1}(\Delta_{d-1})}{d},

using the dilation rule λd1(ρA)=ρd1λd1(A)\lambda_{d-1}(\rho A) = \rho^{d-1}\lambda_{d-1}(A) (Theorem 11.10); with λ1(Δ1)=1\lambda_1(\Delta_1) = 1: volume 1d!\frac1{d!}.

(b) v2=π/Γ(2)=πv_2 = \pi/\Gamma(2) = \pi; v3=π3/2/Γ(52)=π3/2/(3212π)=4π3v_3 = \pi^{3/2}/\Gamma(\frac52) = \pi^{3/2}/(\frac32\cdot\frac12 \sqrt\pi) = \frac{4\pi}3. The ellipsoid is T(B(0,1))T(B(0,1)) with T=diag(a1,,ad)T = \operatorname{diag}(a_1, \dots, a_d): Theorem 11.10 gives volume vdaiv_d\prod a_i.

Exercise 11.7 ★★

For which s>0s > 0 are the following finite? Justify with polar coordinates:

B(0,1)R2 ⁣dx ⁣dy(x2+y2)s,R2B(0,1) ⁣dx ⁣dy(x2+y2)s.\int_{B(0,1)\subseteq\R^2}\frac{\dd x\,\dd y}{(x^2 + y^2)^{s}}, \qquad \int_{\R^2\setminus B(0,1)}\frac{\dd x\,\dd y}{(x^2 + y^2)^{s}} .

Generalize to Rd\R^d (the thresholds s<d/2s < d/2 and s>d/2s > d/2).

Solution

Solution of Exercise 11.7.

In R2\R^2, polar coordinates (Example 11.12):

B(0,1) ⁣dx ⁣dy(x2+y2)s=2π01r12s ⁣dr,R2B(0,1)=2π1r12s ⁣dr:\int_{B(0,1)}\frac{\dd x\dd y}{(x^2+y^2)^s} = 2\pi\int_0^1 r^{1 - 2s}\,\dd r, \qquad \int_{\R^2\setminus B(0,1)} = 2\pi\int_1^\infty r^{1-2s}\dd r:

finite iff 12s>11 - 2s > -1 (s<1s < 1), resp. 12s<11 - 2s < -1 (s>1s > 1). In Rd\R^d, avoid spherical coordinates with the layer cake: λd({x2s>t}B(0,1))=λd(B(0,min(1,t1/2s)))=vdmin(1,td/2s)\lambda_d(\{\norm x^{-2s} > t\}\cap B(0,1)) = \lambda_d(B(0, \min(1, t^{-1/2s}))) = v_d\min(1, t^{-d/2s}), and 0vdmin(1,td/(2s)) ⁣dt<\int_0^\infty v_d\min(1, t^{-d/(2s)})\dd t < \infty iff d2s>1\frac d{2s} > 1, i.e. s<d2s < \frac d2; the exterior integral converges iff s>d2s > \frac d2 (same computation on the complementary region).

Exercise 11.8 ★★★

(Beta–Gamma) For p,q>0p, q > 0, let B(p,q)=01tp1(1t)q1 ⁣dtB(p, q) = \int_0^1t^{p-1}(1 - t)^{q-1}\dd t. Starting from Γ(p)Γ(q)\Gamma(p)\Gamma(q) as a double integral, substitute (x,y)=(uv,u(1v))(x, y) = (uv,\, u(1 - v)) (a diffeomorphism of the open quadrant onto (0,)×(0,1)\intoo0\infty\times\intoo01; compute its Jacobian =u= u) and conclude

B(p,q)=Γ(p)Γ(q)Γ(p+q).B(p, q) = \frac{\Gamma(p)\,\Gamma(q)}{\Gamma(p + q)} .

Deduce 0π/2sin2p1θcos2q1θ ⁣dθ=12B(p,q)\int_0^{\pi/2}\sin^{2p-1}\theta\cos^{2q-1}\theta\, \dd\theta = \frac12B(p,q) and the value of the Wallis integrals Wn=0π/2sinnW_n = \int_0^{\pi/2}\sin^n.

Solution

Solution of Exercise 11.8.

By Tonelli (positive integrands) and the change of variables (x,y)=Φ(u,v)=(uv, u(1v))(x, y) = \Phi(u, v) = (uv,\ u(1-v)), a C1\mathcal C^1 diffeomorphism of (0,)×(0,1)\intoo0\infty\times\intoo01 onto the open quadrant with

detDΦ=det(vu1vu)=uvu(1v)=u,det=u:\det D\Phi = \det\begin{pmatrix} v & u\\ 1 - v & -u \end{pmatrix} = -uv - u(1 - v) = -u, \qquad \abs{\det} = u :
Γ(p)Γ(q)=xp1yq1exy ⁣dx ⁣dy=(uv)p1(u(1v))q1euu ⁣du ⁣dv=Γ(p+q)B(p,q).\Gamma(p)\Gamma(q) = \iint x^{p-1}y^{q-1}\eu^{-x-y}\dd x\,\dd y = \iint (uv)^{p-1}\bigl(u(1{-}v)\bigr)^{q-1}\eu^{-u}\,u\, \dd u\,\dd v = \Gamma(p + q)\,B(p, q).

Substituting t=sin2θt = \sin^2\theta in B(p,q)B(p,q) gives 20π/2sin2p1θcos2q1θ ⁣dθ=B(p,q)2\int_0^{\pi/2}\sin^{2p-1}\theta\cos^{2q-1}\theta\,\dd\theta = B(p, q). Wallis: Wn=0π/2sinnθ ⁣dθ=12B(n+12,12)=Γ(n+12)π2Γ(n2+1)W_n = \int_0^{\pi/2}\sin^n\theta\,\dd\theta = \frac12B\bigl(\frac{n + 1}2, \frac12\bigr) = \frac{\Gamma(\frac{n+1}2)\sqrt\pi} {2\,\Gamma(\frac n2 + 1)} — e.g. W2n=π2(2n)!4n(n!)2W_{2n} = \frac\pi2\cdot\frac{(2n)!}{4^n(n!)^2} using Γ(n+12)=(2n)!4nn!π\Gamma(n + \frac12) = \frac{(2n)!}{4^nn!}\sqrt\pi.

Exercise 11.9 ★★

(Transfer formula) Let T ⁣:(X,A,μ)(Y,B)T \colon (X, \mathcal A, \mu) \to (Y, \mathcal B) be measurable and Tμ(B)=μ(T1(B))T_*\mu(B) = \mu(T^{-1}(B)) the pushforward measure. Show that for every measurable g0g \geq 0 on YY:

Yg ⁣d(Tμ)=XgT ⁣dμ\int_Y g\,\dd(T_*\mu) = \int_X g\circ T\,\dd\mu

(standard machine). Then compare with Theorem 11.10: what extra information does the change of variables formula carry that the abstract transfer formula does not? (The transfer formula never identifies TμT_*\mu; the change of variables theorem computes TλdT_*\lambda_d explicitly as a density measure.)

Solution

Solution of Exercise 11.9.

Indicators: 1B ⁣d(Tμ)=Tμ(B)=μ(T1B)=1BT ⁣dμ\int\mathbf 1_B\,\dd(T_*\mu) = T_*\mu(B) = \mu(T^{-1}B) = \int\mathbf 1_B\circ T\,\dd\mu; linearity extends to simple gg, MCT to g0g \geq 0 — the transfer formula. It is purely formal: it re-expresses integrals against TμT_*\mu but says nothing about what TμT_*\mu is. The content of Theorem 11.10 and Theorem 11.11 is the identification

Φ(λdU)=detDΦ1λdV(a density measure),\Phi_*\bigl(\lambda_d\restriction_U\bigr) = \abs{\det D\Phi^{-1}}\,\lambda_d\restriction_V \quad\text{(a density measure)},

i.e. a computation of the pushforward of Lebesgue measure — the analytic input being the differential geometry of Φ\Phi, not measure-theoretic formalism.

Exercise 11.10 ★★★

(Gaussian moments) Using polar coordinates and Fubini, compute for the standard Gaussian weight on Rd\R^d:

Rdx22  ex22 ⁣dxandRdx12ex22 ⁣dx,\int_{\R^d}\norm x_2^2\;\eu^{-\norm x_2^2}\,\dd x \qquad\text{and}\qquad \int_{\R^d}x_1^2\,\eu^{-\norm x^2_2}\,\dd x,

check the consistency (x2=xi2\norm x^2 = \sum x_i^2), and deduce the second moment of the measure πd/2ex2 ⁣dx\pi^{-d/2}\eu^{-\norm x^2}\dd x.

Solution

Solution of Exercise 11.10.

By Tonelli the Gaussian factorizes, so with G1=Res2 ⁣ds=πG_1 = \int_\R\eu^{-s^2}\dd s = \sqrt\pi and Rs2es2 ⁣ds=π2\int_\R s^2\eu^{-s^2}\dd s = \frac{\sqrt\pi}2 (integrate by parts):

Rdx12ex2 ⁣dx=π2  π(d1)/2=πd/22,Rdx2ex2 ⁣dx=dπd/22\int_{\R^d}x_1^2\,\eu^{-\norm x^2}\dd x = \frac{\sqrt\pi}2\;\pi^{(d-1)/2} = \frac{\pi^{d/2}}2, \qquad \int_{\R^d}\norm x^2\eu^{-\norm x^2}\dd x = d\cdot\frac{\pi^{d/2}}2

(by symmetry, x2=ixi2\norm x^2 = \sum_ix_i^2 contributes dd equal terms — the consistency check). For the normalized measure πd/2ex2 ⁣dx\pi^{-d/2}\eu^{-\norm x^2}\dd x, the second moment is d2\frac d2.

Exercise 11.11 ★★

(Graph and hypograph) Let f ⁣:Rd[0,)f \colon \R^d \to \intco0\infty be measurable. (a) Show that the hypograph H={(x,y)Rd×R:0<y<f(x)}H = \{(x, y) \in \R^d\times\R : 0 < y < f(x)\} is measurable in Rd+1\R^{d+1} with

λd+1(H)=Rdf ⁣dλd:\lambda_{d+1}(H) = \int_{\R^d}f\,\dd\lambda_d :

“the integral is the area under the graph”, at last a theorem. (Sections; Tonelli.) (b) Show that the graph {(x,f(x)):xRd}\{(x, f(x)) : x \in \R^d\} is a null set of Rd+1\R^{d+1}. (c) Deduce a two-line proof that the sphere Sd1S^{d-1} is Lebesgue-null in Rd\R^d.

Solution

Solution of Exercise 11.11.

(a) H=Φ1((0,))H = \Phi^{-1}(\intoo0\infty) for Φ(x,y)=f(x)y\Phi(x, y) = f(x) - y intersected with {y>0}\{y > 0\}: measurable, since (x,y)f(x)(x, y) \mapsto f(x) and (x,y)y(x,y)\mapsto y are measurable on the product (compositions with the projections). The xx-section of HH is (0,f(x))\intoo0{f(x)}, of measure f(x)f(x): Tonelli integrates the sections,

λd+1(H)=Rdλ1((0,f(x))) ⁣dx=Rdf ⁣dλd.\lambda_{d+1}(H) = \int_{\R^d}\lambda_1\bigl(\intoo0{f(x)} \bigr)\,\dd x = \int_{\R^d}f\,\dd\lambda_d .

(b) The graph is {(x,y):yf(x)}{yf(x)}\{(x,y) : y \geq f(x)\} \cap \{y \leq f(x)\}, measurable; its xx-sections are singletons, of measure 00: Tonelli gives λd+1(graph)=0=0\lambda_{d+1}(\text{graph}) = \int 0 = 0.

(c) Sd1S^{d-1} is the union of the two graphs y=±1x2y = \pm\sqrt{1 - \abs{x'}^2} over the unit ball of Rd1\R^{d-1} (splitting the last coordinate): a union of two null sets by (b), null.

Exercise 11.12 ★★

(A famous double integral) Using the geometric series and Tonelli on (0,1)2\intoo01^2, prove

01 ⁣ ⁣01 ⁣dx ⁣dy1xy=n11n2=ζ(2),01 ⁣ ⁣01 ⁣dx ⁣dy1+xy=n1(1)n1n2=ζ(2)2.\int_0^1\!\!\int_0^1\frac{\dd x\,\dd y}{1 - xy} = \sum_{n\geq1}\frac1{n^2} = \zeta(2), \qquad \int_0^1\!\!\int_0^1\frac{\dd x\,\dd y}{1 + xy} = \sum_{n\geq1}\frac{(-1)^{n-1}}{n^2} = \frac{\zeta(2)}2 .

(The second series identity: split even and odd indices.) With ζ(2)=π26\zeta(2) = \frac{\pi^2}6 (Chapter 15), two innocent-looking integrals evaluate to π26\frac{\pi^2}6 and π212\frac{\pi^2}{12}; where exactly does Tonelli’s positivity hypothesis do its work?

Solution

Solution of Exercise 11.12.

On (0,1)2\intoo01^2, 11xy=n0(xy)n\frac1{1 - xy} = \sum_{n\geq0}(xy)^n with nonnegative terms: Tonelli permits term-by-term integration,

 ⁣dx ⁣dy1xy=n0(01xn ⁣dx)(01yn ⁣dy)=n01(n+1)2=ζ(2).\iint\frac{\dd x\,\dd y}{1 - xy} = \sum_{n\geq0}\Bigl(\int_0^1x^n\dd x\Bigr) \Bigl(\int_0^1y^n\dd y\Bigr) = \sum_{n\geq0}\frac1{(n+1)^2} = \zeta(2) .

For the alternating case, 11+xy=n(1)n(xy)n\frac1{1 + xy} = \sum_n(-1)^n(xy)^n is not a positive series; but the integral of the absolute series is ζ(2)<\zeta(2) < \infty, so Fubini (integrability now established) applies:  ⁣dx ⁣dy1+xy=n(1)n(n+1)2\iint\frac{\dd x\dd y}{1 + xy} = \sum_n\frac{(-1)^n}{(n+1)^2}. The series identity:

n1(1)n1n2=n11n22k11(2k)2=ζ(2)ζ(2)2=ζ(2)2.\sum_{n\geq1}\frac{(-1)^{n-1}}{n^2} = \sum_{n\geq1}\frac1{n^2} - 2\sum_{k\geq1}\frac1{(2k)^2} = \zeta(2) - \frac{\zeta(2)}2 = \frac{\zeta(2)}2 .

With ζ(2)=π26\zeta(2) = \frac{\pi^2}6 (Problem 15.1): the integrals are π26\frac{\pi^2}6 and π212\frac{\pi^2}{12}. Tonelli’s positivity was the whole ballgame in the first computation — no integrability check needed before interchanging; in the second, positivity of the absolute series is what certifies integrability so that Fubini may run on the signed one.

11.5 Problem: Stirling’s formula

Problem 11.1

Weekend problem — n!2πn(n/e)nn! \sim \sqrt{2\pi n}\,(n/\eu)^n, by dominated convergence

Stirling’s formula governs every asymptotic count in this book — ball volumes, binomial coefficients, the central limit theorem’s local form. We prove it from the Γ\Gamma integral (Example 10.16) with the Laplace method, in its cleanest dominated-convergence form, then collect dividends.

Part I — The formula. For t>0t > 0, Γ(t+1)=0xtex ⁣dx\Gamma(t + 1) = \int_0^\infty x^{t}\eu^{-x}\dd x.

  1. Substitute x=t+tux = t + \sqrt t\,u and show

    Γ(t+1)ttett=t+exp(tln(1+ut)tu) ⁣du  =  Rgt(u) ⁣du,\frac{\Gamma(t+1)}{t^{t}\eu^{-t}\sqrt t} = \int_{-\sqrt t}^{+\infty} \exp\Bigl(t\ln\Bigl(1 + \frac u{\sqrt t}\Bigr) - \sqrt t\,u\Bigr)\,\dd u \;=\;\int_\R g_t(u)\,\dd u,

    where gt(u)=exp(tln(1+u/t)tu)1u>tg_t(u) = \exp\bigl(t\ln(1 + u/\sqrt t) - \sqrt t\,u\bigr)\mathbf 1_{u > -\sqrt t}.

  2. Show the pointwise limit: for every fixed uu, gt(u)eu2/2g_t(u) \to \eu^{-u^2/2} as t+t \to +\infty (expand ln(1+h)\ln(1 + h) to second order).
  3. Domination. Let φ(h)=ln(1+h)h\varphi(h) = \ln(1 + h) - h, so that gt(u)=exp(tφ(u/t))g_t(u) = \exp\bigl(t\,\varphi(u/\sqrt t)\bigr) for u>tu > -\sqrt t. Prove the two bounds

    φ(h)h24(1<h1),φ(h)ch(h1),  c=1ln2>0\varphi(h) \leq -\frac{h^2}4 \quad (-1 < h \leq 1), \qquad \varphi(h) \leq -c\,h \quad (h \geq 1),\ \ c = 1 - \ln 2 > 0

    (study φ(h)+h24\varphi(h) + \frac{h^2}4 and φ(h)+ch\varphi(h) + ch: compute the derivatives and check the sign on each range). Deduce, for t1t \geq 1:

    gt(u)eu2/4  (ut),gt(u)ecu  (ut),g_t(u) \leq \eu^{-u^2/4}\ \ (\abs u \leq \sqrt t), \qquad g_t(u) \leq \eu^{-cu}\ \ (u \geq \sqrt t),

    so that gt(u)eu2/4+ecu1u>0g_t(u) \leq \eu^{-u^2/4} + \eu^{-cu}\,\mathbf 1_{u > 0}: an integrable dominator independent of t1t \geq 1.

  4. Conclude with the dominated convergence theorem and the Gaussian integral (Example 11.12):

    Γ(t+1)    2πt  (te)t(t+),\Gamma(t + 1) \;\sim\; \sqrt{2\pi t}\;\Bigl(\frac t\eu\Bigr)^{t} \qquad (t \to +\infty),

    and in particular n!2πn(n/e)nn! \sim \sqrt{2\pi n}\,(n/\eu)^n.

Part II — Dividends.

  1. (Wallis) From Exercise 11.8, W2n=π2(2nn)4nW_{2n} = \frac\pi2\binom{2n}n4^{-n}-type formulas: derive (2nn)4nπn\binom{2n}{n} \sim \frac{4^n}{\sqrt{\pi n}} from Stirling, and check it against the recursion Wn=n1nWn2W_{n} = \frac{n-1}nW_{n-2}.
  2. (Ball volumes collapse) Show

    vd=πd/2Γ(d2+1)    1πd(2πed)d/2,v_d = \frac{\pi^{d/2}}{\Gamma(\frac d2 + 1)} \;\sim\; \frac{1}{\sqrt{\pi d}} \Bigl(\frac{2\pi\eu}{d}\Bigr)^{d/2},

    so vd0v_d \to 0 faster than any geometric sequence; find the dimension maximizing vdv_d (numerically: d=5d = 5).

  3. (Concentration of the binomial — a preview of Chapter 23) Using Stirling, show the local estimate, for k=n/2+sn/2k = n/2 + s\sqrt n/2 with ss fixed and nn even:

    2n(nk)    2πn  es2/2,2^{-n}\binom{n}{k} \;\sim\; \sqrt{\frac{2}{\pi n}}\;\eu^{-s^2/2},

    the discrete Gaussian profile: de Moivre–Laplace in embryo.

  4. Where exactly did the proof of Part I use: (i) MCT or DCT; (ii) the Gaussian integral; (iii) the invariance properties of Lebesgue measure? One sentence each.

Part III — The error term: Stirling with bars. Set dn=lnn!(n+12)lnn+nln2πd_n = \ln n! - \bigl(n + \tfrac12\bigr)\ln n + n - \ln\sqrt{2\pi}, so that Part I says dn0d_n \to 0.

  1. Show dndn+1=(n+12)ln(1+1n)1d_n - d_{n+1} = \bigl(n + \tfrac12\bigr)\ln\bigl(1 + \tfrac1n\bigr) - 1.
  2. With t=12n+1t = \frac1{2n+1}, verify n+1n=1+t1t\frac{n+1}n = \frac{1+t}{1-t} and expand:

    dndn+1=t23+t45+t67+,d_n - d_{n+1} = \frac{t^2}3 + \frac{t^4}5 + \frac{t^6}7 + \cdots,

    and deduce the two-sided bounds

    13(2n+1)2  <  dndn+1  <  112n112(n+1).\frac1{3(2n+1)^2} \;<\; d_n - d_{n+1} \;<\; \frac1{12n} - \frac1{12(n+1)} .
  3. Telescope (using dm0d_m \to 0) and check the pleasant algebraic identity 13(2m+1)2>112m+1112(m+1)+1\frac1{3(2m+1)^2} > \frac1{12m+1} - \frac1{12(m+1)+1} for m1m \geq 1, to obtain the classical bracketing

    2πn(ne)ne1/(12n+1)  <  n!  <  2πn(ne)ne1/(12n).\sqrt{2\pi n}\Bigl(\frac n\eu\Bigr)^n \eu^{1/(12n+1)} \;<\; n! \;<\; \sqrt{2\pi n}\Bigl(\frac n\eu\Bigr)^n\eu^{1/(12n)} .
  4. Two consequences: (a) the relative error of Stirling’s formula is <106< 10^{-6} as soon as n83334n \geq 83\,334; (b) estimate 100!100! to four significant digits by hand from the bracketing (100!9.332610157100! \approx 9.3326\cdot 10^{157}), and marvel briefly at the precision of an asymptotic formula at a very finite nn.

Part IV — The Wallis route: Stirling without the Gaussian. Historically the constant 2π\sqrt{2\pi} came from Wallis, not from Gauss; this part re-proves Stirling independently of Parts I–II, and thereby re-proves the Gaussian integral. Let Wn=0π/2sinnθ ⁣dθW_n = \int_0^{\pi/2}\sin^n\theta\, \dd\theta.

  1. Establish Wn=n1nWn2W_n = \frac{n-1}nW_{n-2} (integrate by parts), the closed forms

    W2n=π2(2nn)4n,W2n+1=4n(2n+1)(2nn),W_{2n} = \frac\pi2\binom{2n}n4^{-n}, \qquad W_{2n+1} = \frac{4^n}{(2n+1)\binom{2n}n},

    and the identity WnWn1=π2nW_nW_{n-1} = \frac\pi{2n}.

  2. From the monotonicity of (Wn)(W_n) deduce W2n/W2n+11W_{2n}/W_{2n+1} \to 1, then

    W2n12πnand(2nn)4nn1π:W_{2n} \sim \frac12\sqrt{\frac\pi n} \qquad\text{and}\qquad \binom{2n}n4^{-n}\sqrt n \longrightarrow \frac1{\sqrt\pi} :

    Wallis’ theorem, obtained without Stirling.

  3. Show, by the telescoping of Part III alone (no value of the constant needed), that en=lnn!(n+12)lnn+ne_n = \ln n! - (n + \frac12)\ln n + n converges to some limit \ell; equivalently n!Knn+1/2enn! \sim K\,n^{n+1/2}\eu^{-n} with K=e>0K = \eu^\ell > 0 not yet identified.
  4. Insert this asymptotic into (2nn)4nn\binom{2n}n4^{-n}\sqrt n and identify, using question 14, the only possible value: K=2πK = \sqrt{2\pi}. Assemble the logic: Parts III–IV together give a complete second proof of Stirling — and hence, running Part I’s substitution backwards, an independent evaluation of Reu2/2 ⁣du=2π\int_\R\eu^{-u^2/2}\dd u = \sqrt{2\pi}. Two pillars, either of which supports the other.

Part V — Last dividends.

  1. (The full local profile) For integers jKn\abs j \leq K\sqrt n (KK fixed), show

    (2nn+j)(2nn)=i=1jni+1n+i=exp(j2n+O(1n)),\frac{\binom{2n}{n+j}}{\binom{2n}{n}} = \prod_{i=1}^{\abs j}\frac{n - i + 1}{n + i} = \exp\Bigl(-\frac{j^2}n + O\Bigl(\frac1{\sqrt n}\Bigr)\Bigr),

    uniformly in jj (take logarithms and use ln1x1+y=(x+y)+O(x2+y2)\ln \frac{1-x}{1+y} = -(x + y) + O(x^2 + y^2)). This is the two-sided version of question 7 and the exact estimate quoted in Chapter 23’s weekend problem.

  2. (A Poisson preview) Show with Stirling that ennnn!12πn\eu^{-n}\dfrac{n^n}{n!} \sim \dfrac1{\sqrt{2\pi n}}: the mode of a Poisson law of large mean nn carries mass (2πn)1/2\approx (2\pi n)^{-1/2}, exactly as the central limit theorem will predict.
  3. (Gamma ratios) For a(0,1)a \in \intoo01, prove Γ(n+a)Γ(n)na1\dfrac{\Gamma(n + a)}{\Gamma(n)\,n^a} \to 1 using the log-convexity slope bounds of Problem 10.1 (question 14 there), and extend to every real a>0a > 0 by the functional equation. (This is what “Γ(t+1)\Gamma(t+1) \sim Stirling” means between the integers.)
  4. (Balls, encore) From vd=πd/2/Γ(d2+1)v_d = \pi^{d/2}/\Gamma(\frac d2 + 1): tabulate v1,,v7v_1, \dots, v_7 exactly, verify unimodality via vdvd2=2πd\frac{v_d}{v_{d-2}} = \frac{2\pi}d (increasing while d<2πd < 2\pi, decreasing after), and prove the striking generating identity

    k0v2kx2k=eπx2:\sum_{k\geq0}v_{2k}\,x^{2k} = \eu^{\pi x^2} :

    all even-dimensional unit-ball volumes packed into one exponential.

  5. (Entropy asymptotics) For fixed α(0,1)\alpha \in \intoo01 with αnN\alpha n \in \N, deduce from Stirling

    (nαn)    enH(α)2πα(1α)n,H(α)=αlnα(1α)ln(1α):\binom{n}{\alpha n} \;\sim\; \frac{\eu^{n\,H(\alpha)}} {\sqrt{2\pi\,\alpha(1-\alpha)\,n}}, \qquad H(\alpha) = -\alpha\ln\alpha - (1-\alpha)\ln(1-\alpha) :

    the exponential growth rate of binomial coefficients is the entropy HH — check that α=12\alpha = \frac12 recovers question 5, and that H(α)<ln2H(\alpha) < \ln2 for α12\alpha \neq \frac12 (so off-center binomials are exponentially negligible in 2n2^n).

  6. (Surface areas) The area of the unit sphere Sd1S^{d-1} is sd1=dvds_{d-1} = d\,v_d (proved as Exercise 21.6 in the differential-forms chapter; here, take it as the definition). Tabulate s0,,s6s_0, \dots, s_6, locate the maximal one (d1=6d - 1 = 6, s6=16π31533.07s_6 = \frac{16\pi^3}{15} \approx 33.07), and show sd10s_{d-1} \to 0 super-geometrically as well — high-dimensional spheres are, by every Euclidean yardstick, vanishingly small.
  7. (The first correction term) Deduce from the bracketing of question 11 that dn=112n+O(1n2)d_n = \frac1{12n} + O\bigl(\frac1{n^2}\bigr), hence

    n!=2πn(ne)n(1+112n+O(1n2)).n! = \sqrt{2\pi n}\,\Bigl(\frac n\eu\Bigr)^{n}\Bigl(1 + \frac1{12n} + O\Bigl(\frac1{n^2}\Bigr)\Bigr).

    Verify at n=10n = 10: the bare formula gives 35986963\,598\,696 (relative error 8.31038.3\cdot10^{-3}), the corrected one 36286853\,628\,685 against 10!=362880010! = 3\,628\,800 (relative error 3.21053.2\cdot10^{-5}) — one term of the series buys two and a half digits.

  8. (The median of Γ\Gamma) Show that

    1Γ(t+1)0txtex ⁣dx    12(t+):\frac{1}{\Gamma(t+1)} \int_0^{t} x^{t}\eu^{-x}\,\dd x \;\longrightarrow\; \frac12 \qquad (t \to +\infty) :

    asymptotically, exactly half of the mass of the Γ\Gamma integrand sits below its mode x=tx = t. (Run Part I’s substitution on the truncated integral; the dominator of question 3 is already in place.)

  9. (Entropy, non-asymptotically) For α(0,12]\alpha \in \intoc0{\frac12} prove the bound, valid for every n1n \geq 1:

    k=0αn(nk)    enH(α),\sum_{k=0}^{\lfloor\alpha n\rfloor}\binom nk \;\leq\; \eu^{n\,H(\alpha)} ,

    by comparing the sum with k(nk)λkαn\sum_k\binom nk\lambda^{k-\alpha n} for the tilt λ=α1α1\lambda = \frac{\alpha}{1-\alpha} \leq 1. Check that this choice of λ\lambda is optimal, and reconcile with question 21: the exponential rate H(α)H(\alpha) of the asymptotic statement is attained by a one-line inequality with no asymptotics at all.

Solution

Solution of Problem 11.1.

1. With x=t+tux = t + \sqrt t\,u ( ⁣dx=t ⁣du\dd x = \sqrt t\,\dd u; xx ranges over (0,)\intoo0\infty as uu ranges over (t,)\intoo{-\sqrt t}\infty):

Γ(t+1)=0xtex ⁣dx=ttetttexp(tln(1+ut)tu) ⁣du,\Gamma(t{+}1) = \int_0^\infty x^t\eu^{-x}\dd x = t^t\eu^{-t}\sqrt t\int_{-\sqrt t}^{\infty} \exp\Bigl(t\ln\Bigl(1 + \frac u{\sqrt t}\Bigr) - \sqrt t\,u\Bigr)\dd u,

since xt=ttexp(tln(1+u/t))x^t = t^t\exp\bigl(t\ln(1 + u/\sqrt t)\bigr) and ex=etetu\eu^{-x} = \eu^{-t}\eu^{-\sqrt tu}.

2. For fixed uu and tt \to \infty: tln(1+u/t)tu=t(utu22t+o(1t))tu=u22+o(1)t\ln(1 + u/\sqrt t) - \sqrt tu = t\bigl(\frac u{\sqrt t} - \frac{u^2}{2t} + o(\frac1t)\bigr) - \sqrt tu = -\frac{u^2}2 + o(1): gt(u)eu2/2g_t(u) \to \eu^{-u^2/2}.

3. Set ψ1(h)=φ(h)+h24\psi_1(h) = \varphi(h) + \frac{h^2}4 on (1,1]\intoc{-1}1: ψ1(0)=0\psi_1(0) = 0 and ψ1(h)=11+h1+h2=h(h1)2(1+h)\psi_1'(h) = \frac1{1+h} - 1 + \frac h2 = \frac{h(h-1)}{2(1+h)}, which is 0\geq 0 on (1,0]\intoc{-1}0 and 0\leq 0 on [0,1]\intcc01: ψ10\psi_1 \leq 0, i.e. φ(h)h2/4\varphi(h) \leq -h^2/4 there. Set ψ2(h)=φ(h)+ch\psi_2(h) = \varphi(h) + ch on [1,)\intco1\infty, c=1ln2c = 1 - \ln2: ψ2(1)=ln21+c=0\psi_2(1) = \ln2 - 1 + c = 0 and ψ2(h)=ch1+hc12<0\psi_2'(h) = c - \frac h{1+h} \leq c - \frac12 < 0: φ(h)ch\varphi(h) \leq -ch for h1h \geq 1. Now for t1t \geq 1: if ut\abs u \leq \sqrt t, gt(u)=etφ(u/t)et(u/t)2/4=eu2/4g_t(u) = \eu^{t\varphi(u/\sqrt t)} \leq \eu^{-t(u/\sqrt t)^2/4} = \eu^{-u^2/4}; if utu \geq \sqrt t, then tφ(u/t)ctut=ctucut\,\varphi(u/\sqrt t) \leq -ct\cdot\frac u{\sqrt t} = -c\sqrt t\,u \leq -cu (as t1t \geq 1), so gt(u)ecug_t(u) \leq \eu^{-cu}. Hence gteu2/4+ecu1u>0g_t \leq \eu^{-u^2/4} + \eu^{-cu}\mathbf 1_{u>0}, integrable, independent of t1t \geq 1.

4. DCT: Rgt(u) ⁣duReu2/2 ⁣du=2π\int_\R g_t(u)\dd u \to \int_\R\eu^{-u^2/2}\dd u = \sqrt{2\pi} (Example 11.12 plus the scaling u2uu\mapsto\sqrt2\,u). With question 1:

Γ(t+1)2πt  (te)t,n!2πn(ne)n.\Gamma(t + 1) \sim \sqrt{2\pi t}\;\Bigl(\frac t\eu\Bigr)^t,\qquad n! \sim \sqrt{2\pi n}\,\Bigl(\frac n\eu\Bigr)^n .

5. From Exercise 11.8, W2n=π2(2n)!4n(n!)2=π24n(2nn)W_{2n} = \frac\pi2\,\frac{(2n)!}{4^n(n!)^2} = \frac\pi2\,4^{-n}\binom{2n}n. Stirling:

(2nn)=(2n)!(n!)24πn(2n/e)2n2πn(n/e)2n=4nπn.\binom{2n}{n} = \frac{(2n)!}{(n!)^2} \sim \frac{\sqrt{4\pi n}\,(2n/\eu)^{2n}} {2\pi n\,(n/\eu)^{2n}} = \frac{4^n}{\sqrt{\pi n}} .

Then W2n12π/nW_{2n} \sim \frac12\sqrt{\pi/n}, consistent with the recursion Wn=n1nWn2W_n = \frac{n-1}nW_{n-2} (which forces WnWn2W_n \sim W_{n-2}, and with WnWn1n=π2W_nW_{n-1}\cdot n = \frac\pi2 — the classical Wallis relation — gives Wnπ/(2n)W_n \sim \sqrt{\pi/(2n)}; the two asymptotics agree).

6. Γ(d2+1)2πd2(d2e)d/2\Gamma(\frac d2 + 1) \sim \sqrt{2\pi\frac d2}\,(\frac d{2\eu})^{d/2}, so

vd=πd/2Γ(d2+1)1πd(2πed)d/20v_d = \frac{\pi^{d/2}}{\Gamma(\frac d2 + 1)} \sim \frac{1}{\sqrt{\pi d}}\Bigl(\frac{2\pi\eu} d\Bigr)^{d/2} \longrightarrow 0

super-geometrically (for d>2πe17d > 2\pi\eu \approx 17, each factor <1< 1 and shrinking). Numerically v1=2v_1 = 2, v23.14v_2 \approx 3.14, v34.19v_3 \approx 4.19, v44.93v_4 \approx 4.93, v55.26v_5 \approx 5.26, v65.17v_6 \approx 5.17: the maximum is at d=5d = 5.

7. With k=n2+sn2k = \frac n2 + \frac{s\sqrt n}2 (integer, nn even, ss fixed): take logarithms in 2n(nk)=2nn!k!(nk)!2^{-n}\binom nk = 2^{-n}\frac{n!}{k!(n-k)!} and apply Stirling to the three factorials. Writing k=n2(1+ε)k = \frac n2(1 + \varepsilon), nk=n2(1ε)n - k = \frac n2(1 - \varepsilon) with ε=s/n\varepsilon = s/\sqrt n:

ln(2n(nk))=n2[(1+ε)ln(1+ε)+(1ε)ln(1ε)]+12ln2πn(1ε2)+o(1),\ln\Bigl(2^{-n}\binom nk\Bigr) = -\frac n2\bigl[(1{+}\varepsilon)\ln(1{+}\varepsilon) + (1{-}\varepsilon)\ln(1{-}\varepsilon)\bigr] + \frac12\ln\frac{2}{\pi n(1 - \varepsilon^2)} + o(1),

and the bracket is ε2+O(ε4)=s2n+O(n2)\varepsilon^2 + O(\varepsilon^4) = \frac{s^2}n + O(n^{-2}): the display tends to s22+12ln2πn-\frac{s^2}2 + \frac12\ln\frac2{\pi n} up to o(1)o(1), i.e.

2n(nk)2πn  es2/2:2^{-n}\binom nk \sim \sqrt{\frac{2}{\pi n}}\;\eu^{-s^2/2} :

the Gaussian profile of coin-tossing, quantified — de Moivre–Laplace’s local form, to be globalized in Chapter 23.

8. (i) DCT converts the pointwise limit of question 2 into convergence of the integrals, using question 3’s dominator. (ii) The Gaussian integral evaluates the limit eu2/2=2π\int\eu^{-u^2/2} = \sqrt{2\pi} — Stirling’s constant 2π\sqrt{2\pi} is the Gaussian integral. (iii) The substitution x=t+tux = t + \sqrt tu is an affine change of variables: translation invariance and the scaling rule of Lebesgue measure (Theorem 11.10 in dimension 11).

9. Expand both terms:

dndn+1=lnn!(n+1)!+(n+32)ln(n+1)(n+12)lnn1=(n+12)lnn+1n1,d_n - d_{n+1} = \ln\frac{n!}{(n+1)!} + \Bigl(n + \frac32\Bigr)\ln(n+1) - \Bigl(n + \frac12\Bigr)\ln n - 1 = \Bigl(n + \frac12\Bigr)\ln\frac{n+1}n - 1,

the terms ln(n+1)-\ln(n+1) and (n+32)ln(n+1)(n + \frac32)\ln(n+1) combining into (n+12)ln(n+1)(n + \frac12)\ln(n+1).

10. For t=12n+1t = \frac1{2n+1}: 1+t1t=2n+22n=n+1n\frac{1+t}{1-t} = \frac{2n+2}{2n} = \frac{n+1}n, and n+12=12tn + \frac12 = \frac1{2t}; the odd series ln1+t1t=2k0t2k+12k+1\ln\frac{1+t}{1-t} = 2\sum_{k\geq0}\frac{t^{2k+1}}{2k+1} gives

(n+12)lnn+1n=k0t2k2k+1=1+t23+t45+\Bigl(n + \frac12\Bigr)\ln\frac{n+1}n = \sum_{k\geq0}\frac{t^{2k}}{2k+1} = 1 + \frac{t^2}3 + \frac{t^4}5 + \cdots

Subtract 11. Lower bound: the first term alone, t23=13(2n+1)2\frac{t^2}3 = \frac1{3(2n+1)^2}. Upper bound: lower all denominators to 33 and sum the geometric series: t23(1t2)=13((2n+1)21)=112n(n+1)=112n112(n+1)\frac{t^2}{3(1 - t^2)} = \frac1{3((2n+1)^2 - 1)} = \frac1{12n(n+1)} = \frac1{12n} - \frac1{12(n+1)}.

11. Summing the upper bound from nn to \infty (with dm0d_m \to 0): dn<112nd_n < \frac1{12n}. For the lower bound: 112m+1112(m+1)+1=12(12m+1)(12m+13)\frac1{12m+1} - \frac1{12(m+1)+1} = \frac{12}{(12m+1)(12m+13)}, and

13(2m+1)2>12(12m+1)(12m+13)    (12m+1)(12m+13)>36(2m+1)2    168m+13>144m+36,\begin{align*} \frac1{3(2m+1)^2} > \frac{12}{(12m+1)(12m+13)} &\iff (12m+1)(12m+13) > 36(2m+1)^2 \\ &\iff 168m + 13 > 144m + 36, \end{align*}

true for m1m \geq 1. Summing this telescoping minorant: dn>112n+1d_n > \frac1{12n+1}. Exponentiating gives the classical bracketing of n!n!.

12. (a) Relative error =edn1<e1/(12n)1<1.112n= \eu^{d_n} - 1 < \eu^{1/(12n)} - 1 < \frac{1.1}{12n} for nn large; <106< 10^{-6} as soon as 12n1.110612n \geq 1.1\cdot10^6, and the stated n83334n \geq 83\,334 suffices (112n106\frac1{12n} \leq 10^{-6} already implies it). (b) log10(100!)=12log10(200π)+200100log10e+d100log10e=1.39906+20043.42945+0.00036157.96997\log_{10}(100!) = \frac12\log_{10}(200\pi) + 200 - 100\log_{10}\eu + d_{100}\log_{10}\eu = 1.39906 + 200 - 43.42945 + 0.00036 \approx 157.96997, so 100!100.9699710157=9.33310157100! \approx 10^{0.96997} \cdot 10^{157} = 9.333\cdot10^{157}; the guaranteed window (e1/1201,e1/1200)(\eu^{1/1201}, \eu^{1/1200}) has width under 10610^{-6} in relative terms — an “asymptotic” formula that is, at n=100n = 100, an instrument of precision.

13. Write sinn=sinn2sinn2cos2\sin^n = \sin^{n-2} - \sin^{n-2}\cos^2, and integrate the second term by parts (u=cosθu = \cos\theta,  ⁣dv=sinn2cosθ ⁣dθ\dd v = \sin^{n-2}\cos\theta\,\dd\theta, v=sinn1n1v = \frac{\sin^{n-1}}{n-1}):

0π/2sinn2cos2=[cosθsinn1θn1]0π/2+1n10π/2sinn=Wnn1.\int_0^{\pi/2}\sin^{n-2}\cos^2 = \Bigl[\cos\theta\,\frac{\sin^{n-1}\theta}{n-1}\Bigr]_0^{\pi/2} + \frac1{n-1}\int_0^{\pi/2}\sin^n = \frac{W_n}{n-1} .

Hence Wn=Wn2Wnn1W_n = W_{n-2} - \frac{W_n}{n-1}, i.e. Wn=n1nWn2W_n = \frac{n-1}nW_{n-2}. From W0=π2W_0 = \frac\pi2, W1=1W_1 = 1:

W2n=(2n1)!!(2n)!!π2=π2(2nn)4n,W2n+1=(2n)!!(2n+1)!!=4n(2n+1)(2nn),W_{2n} = \frac{(2n-1)!!}{(2n)!!}\cdot\frac\pi2 = \frac\pi2\binom{2n}n4^{-n}, \qquad W_{2n+1} = \frac{(2n)!!}{(2n+1)!!} = \frac{4^n}{(2n+1)\binom{2n}n},

converting double factorials by (2n)!!=2nn!(2n)!! = 2^nn! and (2n1)!!=(2n)!2nn!(2n-1)!! = \frac{(2n)!}{2^nn!}. Finally nWnWn1=(n1)Wn1Wn2nW_nW_{n-1} = (n-1)W_{n-1}W_{n-2} by the recursion: constant, equal to 1W1W0=π21\cdot W_1W_0 = \frac\pi2.

14. W2n+1W2nW2n1W_{2n+1} \leq W_{2n} \leq W_{2n-1} (pointwise monotonicity of sinn\sin^n) and W2n1W2n+1=2n+12n1\frac{W_{2n-1}}{W_{2n+1}} = \frac{2n+1}{2n} \to 1 squeeze W2nW2n+11\frac{W_{2n}}{W_{2n+1}} \to 1. Combined with W2nW2n+1=π2(2n+1)W_{2n}W_{2n+1} = \frac{\pi}{2(2n+1)} (question 13): W2n2π4nW_{2n}^2 \sim \frac\pi{4n}, so W2n12πnW_{2n} \sim \frac12\sqrt{\frac\pi n} and (2nn)4n=2πW2n1πn\binom{2n}n4^{-n} = \frac2\pi W_{2n} \sim \frac1{\sqrt{\pi n}}.

15. Questions 9–10 never used the value of the constant: with en=lnn!(n+12)lnn+ne_n = \ln n! - (n+\frac12)\ln n + n, the differences enen+1e_n - e_{n+1} lie in (0,112n112(n+1))\bigl(0, \frac1{12n} - \frac1{12(n+1)}\bigr), so (en)(e_n) decreases while (en112n)(e_n - \frac1{12n}) increases: adjacent sequences, converging to a common \ell. Hence n!Knn+1/2enn! \sim K n^{n+1/2}\eu^{-n}, K=eK = \eu^\ell.

16. Substituting the unknown-constant Stirling into the central binomial:

(2nn)4nnK(2n)2n+1/2e2n(Knn+1/2en)24nn=22n2Kn2n+1/2K2n2n+14nn=2K,\binom{2n}n4^{-n}\sqrt n \sim \frac{K\,(2n)^{2n+1/2}\eu^{-2n}}{\bigl(K\,n^{n+1/2} \eu^{-n}\bigr)^2}\,4^{-n}\sqrt n = \frac{2^{2n}\sqrt{2}\,K\,n^{2n+1/2}}{K^2\,n^{2n+1}} \,4^{-n}\sqrt n = \frac{\sqrt2}{K},

and question 14 forces 2K=1π\frac{\sqrt2}K = \frac1{\sqrt\pi}: K=2πK = \sqrt{2\pi}. Parts III–IV thus reprove Stirling from scratch; feeding it into Part I’s identity evaluates Reu2/2 ⁣du=2π\int_\R\eu^{-u^2/2}\dd u = \sqrt{2\pi} without polar coordinates: Wallis and Gauss prop each other up.

17. (2nn+j)(2nn)=(n!)2(n+j)!(nj)!=i=1jni+1n+i\frac{\binom{2n}{n+j}}{\binom{2n}n} = \frac{(n!)^2}{(n+j)!\,(n-j)!} = \prod_{i=1}^{j}\frac{n-i+1}{n+i} for j0j \geq 0 (and by symmetry for j<0j < 0). Taking logarithms, with 1ijKn1 \leq i \leq j \leq K\sqrt n:

lnni+1n+i=ln(1i1n)ln(1+in)=2i1n+O(i2n2),\ln\frac{n-i+1}{n+i} = \ln\Bigl(1 - \frac{i-1}n\Bigr) - \ln\Bigl(1 + \frac in\Bigr) = -\frac{2i-1}{n} + O\Bigl(\frac{i^2}{n^2}\Bigr),

and ij(2i1)=j2\sum_{i\leq j}(2i - 1) = j^2, while the error sums to O(j3/n2)=O(n1/2)O(j^3/n^2) = O(n^{-1/2}): uniformly, exp(j2n+O(n1/2))\exp\bigl(-\frac{j^2}n + O(n^{-1/2})\bigr).

18. ennnn!ennn2πnnnen=12πn\eu^{-n}\frac{n^n}{n!} \sim \eu^{-n} \frac{n^n}{\sqrt{2\pi n}\,n^n\eu^{-n}} = \frac1{\sqrt{2\pi n}}. A Poisson variable of mean nn has standard deviation n\sqrt n, and 12πn\frac1{\sqrt{2\pi n}} is exactly the Gaussian peak height 1σ2π\frac1{\sigma\sqrt{2\pi}}: the local CLT, previewed at the mode.

19. For a(0,1)a \in \intoo01, the slope lemma of Problem 10.1 (question 14 there), applied to the convex logΓ\log\Gamma around nn, gives (n1)aΓ(n+a)Γ(n)na(n-1)^a \leq \frac{\Gamma(n+a)}{\Gamma(n)} \leq n^a: the ratio to nan^a is squeezed by (11n)a1(1 - \frac1n)^a \to 1. For a=m+aa = m + a' (mNm \in \N, a[0,1)a' \in \intco01): Γ(n+a)=(n+a1)(n+a)Γ(n+a)\Gamma(n+a) = (n + a - 1) \cdots(n + a')\Gamma(n + a'), and each of the mm factors is n(1+O(1n))n(1 + O(\frac1n)): multiply the estimates.

20. The recursion vd=2πdvd2v_d = \frac{2\pi}dv_{d-2} (from Γ(d2+1)=d2Γ(d2)\Gamma(\frac d2 + 1) = \frac d2\Gamma(\frac d2)) gives, from v1=2v_1 = 2, v2=πv_2 = \pi:

v3=4π3,v4=π22,v5=8π215,v6=π36,v7=16π3105.v_3 = \frac{4\pi}3,\quad v_4 = \frac{\pi^2}2,\quad v_5 = \frac{8\pi^2}{15},\quad v_6 = \frac{\pi^3}6,\quad v_7 = \frac{16\pi^3}{105}.

The ratio 2πd\frac{2\pi}d exceeds 11 exactly for d6d \leq 6, so each parity increases then decreases; numerically v44.93v_4 \approx 4.93, v55.26v_5 \approx 5.26, v65.17v_6 \approx 5.17: the overall maximum is d=5d = 5. Generating function: v2k=πkk!v_{2k} = \frac{\pi^k}{k!}, so kv2kx2k=eπx2\sum_kv_{2k}x^{2k} = \eu^{\pi x^2} — all even-dimensional ball volumes rolled into one exponential, and an instant super-geometric decay estimate for vdv_d.

21. Stirling in numerator and denominator, with k=αnk = \alpha n:

(nαn)2πnnn2παn(αn)αn2π(1α)n((1α)n)(1α)n=enH(α)2πα(1α)n,\binom n{\alpha n} \sim \frac{\sqrt{2\pi n}\,n^n} {\sqrt{2\pi\alpha n}\,(\alpha n)^{\alpha n}\, \sqrt{2\pi(1-\alpha)n}\,((1-\alpha)n)^{(1-\alpha)n}} = \frac{\eu^{nH(\alpha)}}{\sqrt{2\pi\alpha(1-\alpha)n}},

since nn/(αn)αn((1α)n)(1α)n=ααn(1α)(1α)n=enH(α)n^n/(\alpha n)^{\alpha n}((1-\alpha)n)^{(1-\alpha)n} = \alpha^{-\alpha n}(1-\alpha)^{-(1-\alpha)n} = \eu^{nH(\alpha)} (the powers of nn cancel: αn+(1α)n=n\alpha n + (1-\alpha)n = n), and the en\eu^{-n}’s cancel likewise. At α=12\alpha = \frac12: H=ln2H = \ln2 and the prefactor is 2/(πn)\sqrt{2/(\pi n)} — question 5 again. Strict concavity of HH (its second derivative 1α(1α)<0-\frac1{\alpha(1-\alpha)} < 0) puts its maximum ln2\ln 2 at α=12\alpha = \frac12 only: for α12\alpha \neq \frac12, (nαn)2nen(ln2H(α))\binom n{\alpha n}2^{-n} \approx \eu^{-n(\ln2 - H(\alpha))} decays exponentially — the combinatorial engine behind every concentration statement about coin flips.

22. From sd1=dvds_{d-1} = dv_d and question 20:

s0=2,  s1=2π,  s2=4π,  s3=2π2,  s4=8π23,  s5=π3,  s6=16π315,s_0 = 2,\ \ s_1 = 2\pi,\ \ s_2 = 4\pi,\ \ s_3 = 2\pi^2,\ \ s_4 = \frac{8\pi^2}3,\ \ s_5 = \pi^3,\ \ s_6 = \frac{16\pi^3}{15},

numerically 2, 6.28, 12.57, 19.74, 26.32, 31.01, 33.072,\ 6.28,\ 12.57,\ 19.74,\ 26.32,\ 31.01,\ 33.07; and s7=π4332.47<s6s_7 = \frac{\pi^4}3 \approx 32.47 < s_6: the maximum is the 66-sphere. The recursion sd+1=(d+2)vd+2=(d+2)2πd+2vd=2πvd=2πdsd1s_{d+1} = (d+2)\,v_{d+2} = (d+2)\,\frac{2\pi}{d+2}\,v_d = 2\pi v_d = \frac{2\pi}d\,s_{d-1} shows the same 2πd\frac{2\pi}d-driven rise and super-geometric fall as for volumes: past dimension seven, spheres shrink away faster than any geometric sequence.

23. Question 11 says exactly 112n+1<dn<112n\frac1{12n+1} < d_n < \frac1{12n}, and

112n112n+1=112n(12n+1)=O(1n2),\frac1{12n} - \frac1{12n+1} = \frac1{12n(12n+1)} = O\Bigl(\frac1{n^2}\Bigr),

so dn=112n+O(1n2)d_n = \frac1{12n} + O(\frac1{n^2}) and edn=1+112n+O(1n2)\eu^{d_n} = 1 + \frac1{12n} + O(\frac1{n^2}); multiplying by 2πn(n/e)n\sqrt{2\pi n}(n/\eu)^n gives the corrected formula. At n=10n = 10: 20π(10/e)10=7.92665×453999.33598696\sqrt{20\pi}\,(10/\eu)^{10} = 7.92665 \times 453999.3 \approx 3\,598\,696, low by 3010430\,104 (relative error 8.31038.3\cdot10^{-3}); multiplying by 1+11201 + \frac1{120} gives 36286853\,628\,685, low by 115115 (relative error 3.21053.2\cdot10^{-5}). The bracketing itself pins 10!10! between 3598696e1/12136285593\,598\,696\,\eu^{1/121} \approx 3\,628\,559 and 3598696e1/12036288083\,598\,696\,\eu^{1/120} \approx 3\,628\,808 — the upper bound is off by eight units in seven digits.

24. Part I’s substitution x=t+tux = t + \sqrt t\,u, applied to the truncated integral, gives

0txtex ⁣dx=ttettt0gt(u) ⁣du,\int_0^{t} x^{t}\eu^{-x}\,\dd x = t^{t}\eu^{-t}\sqrt t\int_{-\sqrt t}^{0} g_t(u)\,\dd u ,

the range 0xt0 \leq x \leq t becoming tu0-\sqrt t \leq u \leq 0. The dominator of question 3 covers gt1u<0g_t\mathbf 1_{u < 0} as well, so dominated convergence yields

t0gt(u) ⁣du0eu2/2 ⁣du=2π2,\int_{-\sqrt t}^{0}g_t(u)\,\dd u \longrightarrow \int_{-\infty}^{0}\eu^{-u^2/2}\dd u = \frac{\sqrt{2\pi}}2 ,

while question 4 gives Γ(t+1)ttett2π\Gamma(t+1) \sim t^t\eu^{-t}\sqrt t\,\sqrt{2\pi}. The ratio tends to 12\frac12. Probabilistically: a Gamma random variable of large shape puts asymptotically half its mass on each side of its mode — the central limit theorem’s symmetry, read off from one substitution.

25. Let λ=α1α(0,1]\lambda = \frac{\alpha}{1-\alpha} \in \intoc01. For kαnαnk \leq \lfloor\alpha n\rfloor \leq \alpha n we have λkαn1\lambda^{k - \alpha n} \geq 1, hence

k=0αn(nk)λαnk=0n(nk)λk=(λα(1+λ))n,\sum_{k=0}^{\lfloor\alpha n\rfloor}\binom nk \leq \lambda^{-\alpha n}\sum_{k=0}^{n}\binom nk\lambda^{k} = \Bigl(\lambda^{-\alpha}(1 + \lambda)\Bigr)^{n},

and with λ=α1α\lambda = \frac\alpha{1-\alpha}:

λα(1+λ)=αα(1α)α11α=αα(1α)(1α)=eH(α).\lambda^{-\alpha}(1+\lambda) = \alpha^{-\alpha}(1-\alpha)^{\alpha}\cdot\frac1{1-\alpha} = \alpha^{-\alpha}(1-\alpha)^{-(1-\alpha)} = \eu^{H(\alpha)} .

Optimality: minimizing f(λ)=αlnλ+ln(1+λ)f(\lambda) = -\alpha\ln\lambda + \ln(1+\lambda) over λ>0\lambda > 0, the equation f(λ)=αλ+11+λ=0f'(\lambda) = -\frac\alpha\lambda + \frac1{1+\lambda} = 0 has the unique solution λ=α1α\lambda = \frac\alpha{1-\alpha}, a minimum since f>0f'' > 0 — the exponential-tilting (Chernoff) choice. Reconciliation: by question 21 the single term k=αnk = \lfloor\alpha n\rfloor is already of order enH(α)/2πα(1α)n\eu^{nH(\alpha)}/\sqrt{2\pi\alpha(1-\alpha)n}, so

enH(α)Cnkαn(nk)enH(α):\frac{\eu^{nH(\alpha)}}{C\sqrt n} \leq \sum_{k\leq\alpha n}\binom nk \leq \eu^{nH(\alpha)} :

the rate H(α)H(\alpha) is exact, the whole sum costing at most a factor n\sqrt n over its largest term. Divided by 2n2^n, this is the fair-coin tail bound P(Snαn)en(ln2H(α))\P(S_n \leq \alpha n) \leq \eu^{-n(\ln2 - H(\alpha))} — concentration of measure in one line.