Book 4A

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

Course 4Book 4A: Function Spaces and Sobolev SpacesChapter 1

Banach Spaces and Bounded Operators

Normed spaces, operator norms, and why the unit ball is compact only in finite dimensions.

23 min read · Updated Oct 2, 2026

Read with Kreyszig, Introductory Functional Analysis with Applications, chapter 2, "Normed Spaces. Banach Spaces" (§2.1–2.10), skimming chapter 1, which repeats Book 2B. Brezis has no separate chapter on these basics; his chapter 1 starts at Hahn–Banach ([[4A.3]]).

In this chapter · 7 sections
  1. 1.1A vibrating string
  2. 1.2Normed and Banach spaces
  3. 1.3Bounded linear operators
  4. 1.4Finite dimensions are special
  5. 1.5The Neumann series
  6. 1.6History
  7. 1.7Exercises

Book 3A produced spaces of functions, LpL^p and C(K)C(K), that are vector spaces with a notion of length, and complete. This book studies such spaces in general. The subject is functional analysis, and its slogan is that functions are points: a solution of a differential equation is a point in a space of functions, an equation is a map between such spaces, and solving it is a question about that map. Linear algebra handles this in finite dimensions (1A.2 Linear Maps and Matrices). Functional analysis does it in infinite dimensions, where the most useful facts of linear algebra, above all compactness of the unit ball, fail.

This first chapter sets up the language: normed spaces and Banach spaces (complete normed spaces), bounded linear operators between them, and the operator norm. Then it proves the theorem that explains why the rest of the book is needed: the closed unit ball of a normed space is compact if and only if the space is finite-dimensional (Riesz's lemma). In infinite dimensions, bounded sequences need not have convergent subsequences, and every later chapter is, in one way or another, about getting compactness back. The chapter ends with the Neumann series, the infinite-dimensional geometric series, which inverts operators close to the identity and is the simplest perturbative existence theorem.

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

  • recognise the standard Banach spaces (ℓp\ell^p, LpL^p, C(K)C(K), CkC^k) and show that a normed space is or isn't complete;
  • prove that a linear map is continuous exactly when it is bounded, and compute operator norms;
  • prove Riesz's lemma and deduce that the unit ball is compact only in finite dimensions;
  • invert I−AI - A by the Neumann series, and show that invertible operators form an open set;
  • interpret operator norms and condition numbers in practice.

A vibrating string

In the world Model The harmonics of a guitar string

A string of length 11 fixed at both ends vibrates in a superposition of normal modes, sin⁡(nπx)\sin(n\pi x) for n=1,2,3,…n = 1, 2, 3, \ldots: the fundamental and its harmonics, with frequencies proportional to nn. Its shape at any instant is a Fourier series in these modes (2B.7 Fourier Series and the First Heat Equation), and in the space L2(0,1)L^2(0, 1) of shapes with finite energy the normalised modes

en(x)=2 sin⁡(nπx)e_n(x) = \sqrt2\,\sin(n\pi x)

are orthonormal: ∫01en2=1\int_0^1e_n^2 = 1 and ∫01enem=0\int_0^1e_ne_m = 0 for n≠mn \neq m (Figure 1.1).

So the modes are a sequence of points on the unit sphere of L2(0,1)L^2(0, 1), all at the same distance from each other: ∥en−em∥22=1+1−0=2\|e_n - e_m\|_2^2 = 1 + 1 - 0 = 2, so ∥en−em∥2=2\|e_n - e_m\|_2 = \sqrt2. A bounded sequence whose terms are all 2\sqrt2 apart has no Cauchy subsequence, so no convergent one. A real physical object, a string, exhibits in its harmonics the infinitely many independent directions that make infinite-dimensional spaces different. This is the "oscillation" panel of 2B.3 Compactness, made exact.

Figure 1.1. The first five normalised modes 2sin⁡(nπx)\sqrt2\sin(n\pi x) of a string on [0,1][0, 1]. In L2(0,1)L^2(0, 1) each has norm 11 and any two are at distance 2\sqrt2: an infinite bounded set with no convergent subsequence.

Normed and Banach spaces

Definition 1.1 Norm, Banach space

A norm on a real or complex vector space XX is a function ∥⋅∥:X→[0,∞)\|\cdot\| : X \to [0, \infty) with

  1. ∥x∥=0\|x\| = 0 only for x=0x = 0;
  2. ∥λx∥=∣λ∣ ∥x∥\|\lambda x\| = |\lambda|\,\|x\| for scalars λ\lambda;
  3. ∥x+y∥≤∥x∥+∥y∥\|x + y\| \leq \|x\| + \|y\|.

A normed space is a metric space with d(x,y)=∥x−y∥d(x, y) = \|x - y\| (2B.1 Metric Spaces). A Banach space is a normed space that is complete.

The examples so far are all Banach spaces:

The norm has to fit the space. C1([0,1])C^1([0, 1]) with the sup norm (ignoring the derivative) is a normed space but not a Banach space: smooth functions such as (x−12)2+1n\sqrt{(x - \frac12)^2 + \frac1n} converge uniformly to ∣x−12∣|x - \frac12|, which is not C1C^1. The sequence is Cauchy in the sup norm, and its limit is outside the space. Complete spaces come from norms that control everything the space's definition asks for.

A useful test: a normed space is complete if and only if every absolutely convergent series converges, that is, ∑∥xk∥<∞\sum\|x_k\| < \infty implies that the partial sums of ∑xk\sum x_k converge (Exercise 1.9). That is how Riesz–Fischer was proved in 3A.7 Lᵖ Spaces and Jensen’s Inequality.

Bounded linear operators

A linear map between normed spaces is usually called an operator.

Proposition 1.2 Continuous means bounded

For a linear map T:X→YT : X \to Y between normed spaces, the following are equivalent:

  1. TT is continuous;
  2. TT is continuous at 00;
  3. TT is bounded: there is CC with ∥Tx∥≤C∥x∥\|Tx\| \leq C\|x\| for all xx.

Proof. (1) ⇒ (2) is clear. (2) ⇒ (3): with ε=1\varepsilon = 1, there is δ>0\delta > 0 with ∥Tx∥≤1\|Tx\| \leq 1 when ∥x∥≤δ\|x\| \leq \delta. For x≠0x \neq 0, apply this to δx/∥x∥\delta x/\|x\|: ∥Tx∥≤1δ∥x∥\|Tx\| \leq \frac1\delta\|x\|. (3) ⇒ (1): ∥Tx−Ty∥=∥T(x−y)∥≤C∥x−y∥\|Tx - Ty\| = \|T(x - y)\| \leq C\|x - y\|, so TT is Lipschitz.

"Bounded" here means bounded on the unit ball, not bounded on the whole space (no non-zero linear map is that). The best constant is the operator norm

∥T∥=sup⁡∥x∥≤1∥Tx∥=sup⁡x≠0∥Tx∥∥x∥,\|T\| = \sup_{\|x\| \leq 1}\|Tx\| = \sup_{x \neq 0}\frac{\|Tx\|}{\|x\|},

the largest factor by which TT stretches a vector (2B.8 Calculus in Several Variables). The bounded operators from XX to YY form a vector space L(X,Y)L(X, Y), normed by ∥T∥\|T\|, and ∥ST∥≤∥S∥ ∥T∥\|ST\| \leq \|S\|\,\|T\|. If YY is a Banach space, so is L(X,Y)L(X, Y) (Exercise 1.12). The case Y=RY = \mathbb{R} (or C\mathbb{C}) gives the dual space X∗=L(X,R)X^* = L(X, \mathbb{R}) of bounded linear functionals, the subject of 4A.3 Hahn–Banach and Duality.

Example 1.3 Operators, bounded and unbounded
  • Matrices. On Rn\mathbb{R}^n with the Euclidean norm, ∥A∥\|A\| is the largest singular value of AA, the length of the longest semi-axis of the ellipse (or ellipsoid) AA maps the unit sphere to (Figure 1.2). With the ℓ∞\ell^\infty norm on both sides, ∥A∥\|A\| is the largest row sum max⁡i∑j∣aij∣\max_i\sum_j|a_{ij}| (Exercise 1.11).
  • Integral operators. For a continuous kernel K(x,y)K(x, y) on [0,1]2[0, 1]^2, Tf(x)=∫01K(x,y)f(y) dyTf(x) = \int_0^1K(x, y)f(y)\,dy is bounded on C([0,1])C([0, 1]) with ∥T∥≤sup⁡x∫01∣K(x,y)∣ dy\|T\| \leq \sup_x\int_0^1|K(x, y)|\,dy. Solution operators of differential equations are usually of this kind.
  • Shifts. On ℓ2\ell^2, the right shift S(x1,x2,…)=(0,x1,x2,…)S(x_1, x_2, \ldots) = (0, x_1, x_2, \ldots) has ∥Sx∥=∥x∥\|Sx\| = \|x\|, so ∥S∥=1\|S\| = 1; it is injective but not surjective, something impossible for a square matrix.
  • Differentiation is unbounded on C1([0,1])C^1([0, 1]) with the sup norm: fn(x)=sin⁡(nx)f_n(x) = \sin(nx) has ∥fn∥∞≤1\|f_n\|_\infty \leq 1 but ∥fn′∥∞=n\|f_n'\|_\infty = n. This is the basic fact behind every regularity problem in PDE: differentiation loses control, integration regains it. With the C1C^1 norm on the domain and the sup norm on the target, differentiation is bounded, with norm 11; the choice of norms decides.
Figure 1.2. A 2×22 \times 2 matrix maps the unit circle to an ellipse. Its operator norm is the longest semi-axis, σ1\sigma_1; the shortest is σ2\sigma_2, and ∥A−1∥=1/σ2\|A^{-1}\| = 1/\sigma_2. The ratio σ1/σ2=∥A∥ ∥A−1∥\sigma_1/\sigma_2 = \|A\|\,\|A^{-1}\| is the condition number.
In the world In use Condition numbers: how many digits a computation can lose

To solve Ax=bAx = b, a computer works with bb known only to some relative accuracy (from measurement, or from rounding at about 10−1610^{-16} in double precision). If bb is perturbed by δb\delta b, the solution moves by A−1δbA^{-1}\delta b, and

∥δx∥∥x∥≤∥A∥ ∥A−1∥ ∥δb∥∥b∥.\frac{\|\delta x\|}{\|x\|} \leq \|A\|\,\|A^{-1}\|\,\frac{\|\delta b\|}{\|b\|}.

The condition number κ(A)=∥A∥ ∥A−1∥\kappa(A) = \|A\|\,\|A^{-1}\| bounds the factor by which relative errors can be amplified. Numerical analysts' rule of thumb follows: a condition number of about 10k10^k can cost about kk significant digits. The 5×55 \times 5 Hilbert matrix, with entries 1i+j−1\frac{1}{i + j - 1} (which arises in least-squares fitting by polynomials), has κ≈4.8×105\kappa \approx 4.8 \times 10^5 in the Euclidean norm, so about six of the sixteen digits of double precision can be lost in solving with it. The operator norm is the tool that makes "how sensitive is this computation?" a precise question.

In the world In use The H∞ norm in control engineering

In control engineering a linear, time-invariant system (an amplifier, a car's suspension, an aircraft's response to gusts) maps an input signal to an output signal, and its operator norm from finite-energy inputs (L2L^2) to outputs is called its H∞ norm: the largest possible ratio of output energy to input energy, over all inputs. It equals the peak of the magnitude of the system's frequency response, the worst frequency to excite it at. "Robust control", developed from George Zames's work around 1981, designs controllers to keep this operator norm small, so that disturbances of any shape are guaranteed not to be amplified by more than a known factor.

Finite dimensions are special

In a finite-dimensional normed space everything is as in Rn\mathbb{R}^n. All norms are equivalent (2B.3 Compactness, proved there by the contradiction–compactness template); hence every finite-dimensional normed space is complete, every finite-dimensional subspace of a normed space is closed, every linear map from a finite-dimensional space is bounded, and closed bounded sets are compact (Heine–Borel). The last property is the one that characterises finite dimensions.

Lemma 1.4 Riesz's lemma

Let YY be a closed proper subspace of a normed space XX, and 0<θ<10 < \theta < 1. There is x∈Xx \in X with ∥x∥=1\|x\| = 1 and ∥x−y∥≥θ\|x - y\| \geq \theta for every y∈Yy \in Y.

Proof. Pick x0∉Yx_0 \notin Y, and let d=inf⁡y∈Y∥x0−y∥d = \inf_{y\in Y}\|x_0 - y\|, which is positive because YY is closed. Choose y0∈Yy_0 \in Y with ∥x0−y0∥≤d/θ\|x_0 - y_0\| \leq d/\theta (possible since d/θ>dd/\theta > d). Let x=x0−y0∥x0−y0∥x = \frac{x_0 - y_0}{\|x_0 - y_0\|}. For y∈Yy \in Y, the point y0+∥x0−y0∥ yy_0 + \|x_0 - y_0\|\,y lies in YY, so

∥x−y∥=∥x0−(y0+∥x0−y0∥y)∥∥x0−y0∥≥dd/θ=θ.\|x - y\| = \frac{\big\|x_0 - \big(y_0 + \|x_0 - y_0\|y\big)\big\|}{\|x_0 - y_0\|} \geq \frac{d}{d/\theta} = \theta.
Figure 1.3. Riesz's lemma: for any closed proper subspace YY there is a unit vector at distance nearly 11 from all of YY. In a Hilbert space one can take the unit normal and get distance exactly 11 (4A.4 Hilbert Spaces and Lax–Milgram); in a general normed space, "nearly" is the best one can do.
Theorem 1.5 Compact unit ball means finite dimension

The closed unit ball of a normed space XX is compact if and only if XX is finite-dimensional.

Proof. If XX is finite-dimensional, the ball is closed and bounded, hence compact. If XX is infinite-dimensional, build unit vectors x1,x2,…x_1, x_2, \ldots inductively: given x1,…,xnx_1, \ldots, x_n, their span YnY_n is finite-dimensional, so closed and proper, and Riesz's lemma with θ=12\theta = \tfrac12 gives a unit vector xn+1x_{n+1} at distance at least 12\tfrac12 from YnY_n, in particular from each xix_i. Then ∥xm−xn∥≥12\|x_m - x_n\| \geq \tfrac12 for all m≠nm \neq n, so no subsequence is Cauchy.

This is the theorem behind the rest of the book. Bounded sequences in infinite-dimensional spaces need not have convergent subsequences, so existence proofs can't simply extract a limit as in 2B.3 Compactness. Compactness has to be recovered in other ways: in a weaker topology (4A.6 Weak Convergence and the Direct Method), by an extra derivative bound that makes a family equicontinuous (2B.5 Uniform Convergence and Arzelà–Ascoli) or precompact in a Sobolev sense (4A.10 Sobolev Embeddings and Critical Exponents), or by operators that are themselves compact (4A.7 Compact Operators and Spectra).

The Neumann series

In a Banach algebra of operators, the geometric series of 2A.7 Series inverts operators close to the identity.

Theorem 1.6 Neumann series

Let XX be a Banach space and A∈L(X,X)A \in L(X, X) with ∥A∥<1\|A\| < 1. Then I−AI - A is invertible, with bounded inverse

(I−A)−1=∑k=0∞Ak,∥(I−A)−1∥≤11−∥A∥.(I - A)^{-1} = \sum_{k=0}^\infty A^k, \qquad \|(I - A)^{-1}\| \leq \frac{1}{1 - \|A\|}.

Proof. ∥Ak∥≤∥A∥k\|A^k\| \leq \|A\|^k, so the series converges absolutely in the Banach space L(X,X)L(X, X), to some BB with ∥B∥≤∑∥A∥k=11−∥A∥\|B\| \leq \sum\|A\|^k = \frac1{1 - \|A\|}. Telescoping, (I−A)∑k=0NAk=I−AN+1→I(I - A)\sum_{k=0}^NA^k = I - A^{N+1} \to I, and similarly on the other side; so (I−A)B=B(I−A)=I(I - A)B = B(I - A) = I.

The equation (I−A)u=f(I - A)u = f is solved by u=f+Af+A2f+⋯u = f + Af + A^2f + \cdots, the iteration uk+1=f+Auku_{k+1} = f + Au_k, which is a contraction (2B.2 Completeness and Contraction) because ∥A∥<1\|A\| < 1. The Neumann series is the linear case of the contraction mapping principle, with a formula.

Corollary 1.7 Invertible operators form an open set

If T∈L(X,Y)T \in L(X, Y) is invertible with bounded inverse and ∥S∥<1/∥T−1∥\|S\| < 1/\|T^{-1}\|, then T+ST + S is invertible. The map T↦T−1T \mapsto T^{-1} is continuous on the set of invertible operators.

Proof. T+S=T(I+T−1S)T + S = T(I + T^{-1}S) and ∥T−1S∥≤∥T−1∥ ∥S∥<1\|T^{-1}S\| \leq \|T^{-1}\|\,\|S\| < 1, so apply the Neumann series to −T−1S-T^{-1}S. Continuity of inversion follows from the series too (Exercise 1.13).

Example 1.8 An integral equation that is always solvable

On C([0,1])C([0, 1]), consider u(x)=f(x)+λ∫0xu(y) dyu(x) = f(x) + \lambda\int_0^xu(y)\,dy, which is (I−λV)u=f(I - \lambda V)u = f with the Volterra operator Vu(x)=∫0xuVu(x) = \int_0^xu. By induction ∣Vku(x)∣≤xkk!∥u∥∞|V^ku(x)| \leq \frac{x^k}{k!}\|u\|_\infty, so ∥Vk∥≤1k!\|V^k\| \leq \frac1{k!} and ∑k∣λ∣k∥Vk∥≤e∣λ∣\sum_k|\lambda|^k\|V^k\| \leq e^{|\lambda|}. The Neumann series converges for every λ\lambda, even when ∥λV∥=∣λ∣≥1\|\lambda V\| = |\lambda| \geq 1: what matters is that ∥Ak∥1/k→0\|A^k\|^{1/k} \to 0. (This is 2B.2 Completeness and Contraction's eventually contracting map, now with operators, and 2B.10 Ordinary Differential Equations's Picard iteration for u′=λuu' = \lambda u.)

Where this goes Perturbation: "close to invertible is invertible"

Corollary 1.7 is the linear core of thread L. If a linear operator L0L_0 is invertible, every operator close to it is invertible, with a controlled inverse. Combined with the contraction principle it gives the inverse function theorem in Banach spaces, used to solve nonlinear PDE near a known solution: the short-time existence of nonlinear parabolic equations (6A.7 Nonlinear Parabolic Equations) and of the DeTurck–Ricci flow (11A.3 Short-Time Existence and Uniqueness) are proved by showing that the linearised operator is invertible between suitable Banach spaces, then perturbing. The norms must be chosen so that both the operator and its inverse are bounded, which is exactly why Hölder spaces (4A.11 Hölder Spaces) rather than CkC^k spaces are used there.

History

Stefan Banach's 1920 thesis and his book Théorie des opérations linéaires (1932) made complete normed spaces a subject; Norbert Wiener and Hans Hahn reached the same definition independently around 1920–22. Frigyes Riesz proved his lemma in 1918, in a paper on what are now called compact operators. The series inversion goes back to Carl Neumann's work on potential theory in 1877, and Ivar Fredholm's 1903 theory of integral equations, the first great success of infinite-dimensional linear algebra, used it. Vito Volterra studied the integral equations named after him in the 1890s.

Recall Where we stand

A Banach space is a complete normed vector space: ℓp\ell^p, LpL^p, C(K)C(K), CkC^k. Linear operators are continuous exactly when bounded, and the operator norm measures the largest stretch; differentiation is unbounded on C0C^0, which is the root of regularity problems. In finite dimensions all norms agree and closed bounded sets are compact; by Riesz's lemma, the closed unit ball is compact only in finite dimensions. The Neumann series inverts I−AI - A when ∥A∥<1\|A\| < 1, and invertible operators form an open set. 4A.2 Baire Category and Its Consequences proves three theorems that rest on completeness alone, through the Baire category theorem: uniform boundedness, open mapping and closed graph.

Exercises

Exercise 1.9 Completeness by series

Show that a normed space XX is complete if and only if every series ∑xk\sum x_k with ∑∥xk∥<∞\sum\|x_k\| < \infty converges in XX. (For "if", extract from a Cauchy sequence a subsequence with ∥xnk+1−xnk∥≤2−k\|x_{n_{k+1}} - x_{n_k}\| \leq 2^{-k} and sum the differences.)

Exercise 1.10 An incomplete space

Show that fn(x)=(x−12)2+1nf_n(x) = \sqrt{(x - \frac12)^2 + \frac1n} is Cauchy in C1([0,1])C^1([0, 1]) with the sup norm (ignoring derivatives), but not with the C1C^1 norm, and that its uniform limit is not in C1C^1.

Solution

∣fn(x)−∣x−12∣∣≤1n|f_n(x) - |x - \tfrac12|| \leq \frac{1}{\sqrt n}, so fnf_n converges uniformly to ∣x−12∣|x - \frac12|, hence is Cauchy in the sup norm. The derivatives fn′(x)=x−1/2(x−1/2)2+1/nf_n'(x) = \frac{x - 1/2}{\sqrt{(x-1/2)^2 + 1/n}} converge pointwise to sign⁡(x−12)\operatorname{sign}(x - \frac12), which is discontinuous, so they don't converge uniformly and (fn)(f_n) isn't Cauchy in C1C^1.

Exercise 1.11 Matrix norms

For an m×nm \times n matrix AA, show that (a) with the ℓ∞\ell^\infty norm on both sides, ∥A∥=max⁡i∑j∣aij∣\|A\| = \max_i\sum_j|a_{ij}|; (b) with the ℓ1\ell^1 norm on both sides, ∥A∥=max⁡j∑i∣aij∣\|A\| = \max_j\sum_i|a_{ij}|; (c) with the Euclidean norm, ∥A∥2\|A\|^2 is the largest eigenvalue of ATAA^{\mathsf T}A.

Exercise 1.12 Operators form a Banach space

Show that L(X,Y)L(X, Y) is complete when YY is. (A Cauchy sequence TnT_n converges pointwise, Tnx→TxT_nx \to Tx; show TT is linear, bounded, and ∥Tn−T∥→0\|T_n - T\| \to 0.)

Exercise 1.13 Inversion is continuous

Let TT be invertible and ∥S∥≤12∥T−1∥\|S\| \leq \frac1{2\|T^{-1}\|}. Show ∥(T+S)−1−T−1∥≤2∥T−1∥2∥S∥\|(T + S)^{-1} - T^{-1}\| \leq 2\|T^{-1}\|^2\|S\|. (Write (T+S)−1−T−1=−(T+S)−1ST−1(T + S)^{-1} - T^{-1} = -(T + S)^{-1}ST^{-1}.)

Exercise 1.14 Ill-conditioning in practice

The Hilbert matrix HnH_n has entries 1i+j−1\frac{1}{i + j - 1}. (a) Show it is the Gram matrix ⟨xi−1,xj−1⟩\langle x^{i-1}, x^{j-1}\rangle of the monomials in L2(0,1)L^2(0, 1), so it arises when fitting polynomials by least squares in the monomial basis. (b) Explain, using the near-linear-dependence of xn−1x^{n-1} and xnx^n on [0,1][0, 1] for large nn, why HnH_n is badly conditioned. (Its condition number grows roughly like e3.5ne^{3.5n}; it is about 4.8×1054.8 \times 10^5 for n=5n = 5 and 1.6×10131.6 \times 10^{13} for n=10n = 10.) Orthogonal polynomials (4A.4 Hilbert Spaces and Lax–Milgram) are the cure.

Exercise 1.15 Rehearsal: stability of invertibility

Let L0:X→YL_0 : X \to Y be invertible with ∥L0−1∥≤C\|L_0^{-1}\| \leq C, and let LtL_t, t∈[0,1]t \in [0, 1], be operators with ∥Lt−L0∥≤Kt\|L_t - L_0\| \leq Kt. Show that LtL_t is invertible for t<1KCt < \frac{1}{KC} with ∥Lt−1∥≤C1−KCt\|L_t^{-1}\| \leq \frac{C}{1 - KCt}. In 11A.3 Short-Time Existence and Uniqueness and 6A.7 Nonlinear Parabolic Equations the "operator" is a linearised differential operator, tt is the size of a perturbation of the initial data or a short time, and this estimate is what makes the contraction argument close up.

Solution

Lt=L0(I+L0−1(Lt−L0))L_t = L_0(I + L_0^{-1}(L_t - L_0)) and ∥L0−1(Lt−L0)∥≤CKt<1\|L_0^{-1}(L_t - L_0)\| \leq CKt < 1. By the Neumann series, ∥Lt−1∥≤∥L0−1∥1−CKt\|L_t^{-1}\| \leq \frac{\|L_0^{-1}\|}{1 - CKt}.

© 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.