Unit 8: Multivariable Analysis: Euclidean Topology, Fréchet Derivatives & Multiple Integrals
Comprehensive mathematical theory of multivariable real analysis in Euclidean space R^n: inner product spaces, norms, Cauchy-Schwarz inequality, topology of R^n, multivariable limits and continuity, partial derivatives, the total Fréchet derivative and Jacobian matrix, the Multivariable Chain Rule, the Inverse Function Theorem, the Implicit Function Theorem, and multiple Riemann integrals, Fubini's Theorem, and the Change of Variables theorem with Jacobian determinants.
§8.1 Euclidean Space R^n: Inner Product, Norms, Cauchy-Schwarz & Open Balls
1. Vector Space Structure of $\mathbb{R}^n$
Euclidean $n$-space is the Cartesian product $\mathbb{R}^n = \mathbb{R} \times \dots \times \mathbb{R}$ of all ordered $n$-tuples of real numbers:
Endowed with componentwise addition $\mathbf{x} + \mathbf{y}$ and scalar multiplication $c \mathbf{x}$, $\mathbb{R}^n$ forms an $n$-dimensional real vector space.
Definition 8.1 (Euclidean Inner Product and Norm):
- The inner product (or dot product) of $\mathbf{x}, \mathbf{y} \in \mathbb{R}^n$ is:
- The standard Euclidean norm (magnitude) is:
2. The Cauchy-Schwarz Inequality
Theorem 8.1 (Cauchy-Schwarz Inequality): For all $\mathbf{x}, \mathbf{y} \in \mathbb{R}^n$:
with equality holding if and only if $\mathbf{x}$ and $\mathbf{y}$ are linearly dependent (parallel).
Complete Line-by-Line Proof:
If $\mathbf{y} = \mathbf{0}$, both sides equal zero, and equality trivially holds. Assume $\mathbf{y} \ne \mathbf{0}$, so $\|\mathbf{y}\|^2 > 0$. For any scalar $t \in \mathbb{R}$, consider the vector $\mathbf{x} - t \mathbf{y}$. By positive-definiteness of the inner product:
Expanding via bilinearity and symmetry:
This is a quadratic polynomial $q(t) = A t^2 + B t + C$ in the variable $t$, where $A = \|\mathbf{y}\|^2 > 0$, $B = -2\langle \mathbf{x}, \mathbf{y} \rangle$, and $C = \|\mathbf{x}\|^2$. Since $q(t) \ge 0$ for all real $t$, this parabola cannot have two distinct real roots. Therefore, its discriminant $\Delta = B^2 - 4AC$ must be non-positive:
Taking square roots yields:
Corollary 8.1 (Triangle Inequality in $\mathbb{R}^n$): For all $\mathbf{x}, \mathbf{y} \in \mathbb{R}^n$:
Proof: $\|\mathbf{x} + \mathbf{y}\|^2 = \|\mathbf{x}\|^2 + 2\langle \mathbf{x}, \mathbf{y} \rangle + \|\mathbf{y}\|^2 \le \|\mathbf{x}\|^2 + 2\|\mathbf{x}\|\|\mathbf{y}\| + \|\mathbf{y}\|^2 = (\|\mathbf{x}\| + \|\mathbf{y}\|)^2$. $\blacksquare$
3. Topology of $\mathbb{R}^n$
The metric on $\mathbb{R}^n$ is $d(\mathbf{x}, \mathbf{y}) = \|\mathbf{x} - \mathbf{y}\|$.
- An open ball centered at $\mathbf{x}_0$ with radius $r > 0$ is $B(\mathbf{x}_0, r) = \{ \mathbf{x} \in \mathbb{R}^n : \|\mathbf{x} - \mathbf{x}_0\| < r \}$.
- A subset $U \subseteq \mathbb{R}^n$ is open if every point is interior: $\forall \mathbf{x} \in U, \; \exists r > 0 \text{ s.t. } B(\mathbf{x}, r) \subseteq U$.
- The Heine-Borel Theorem holds verbatim in $\mathbb{R}^n$: A subset $K \subset \mathbb{R}^n$ is compact if and only if it is closed and bounded.
- The space $\mathbb{R}^n$ is complete: every Cauchy sequence in $\mathbb{R}^n$ converges.
§8.2 Limits, Continuity, Partial Derivatives & The Total Fréchet Derivative
1. Limits and Continuity in Multivariable Spaces
Definition 8.2 (Multivariable Limit): Let $E \subseteq \mathbb{R}^n$, $\mathbf{f}: E \to \mathbb{R}^m$, and $\mathbf{c}$ be a limit point of $E$. We write $\lim_{\mathbf{x} \to \mathbf{c}} \mathbf{f}(\mathbf{x}) = \mathbf{L} \in \mathbb{R}^m$ if:
2. Directional and Partial Derivatives
Definition 8.3 (Directional Derivative): Let $U \subseteq \mathbb{R}^n$ be open, $f: U \to \mathbb{R}$, $\mathbf{x} \in U$, and $\mathbf{v} \in \mathbb{R}^n$ be a unit vector ($\|\mathbf{v}\| = 1$). The directional derivative of $f$ at $\mathbf{x}$ in the direction of $\mathbf{v}$ is:
If $\mathbf{v} = \mathbf{e}_j$ (the $j$-th standard basis vector), this is the partial derivative:
Cautionary Insight: The existence of ALL partial derivatives (and even all directional derivatives) at a point does NOT imply continuity! For example: $f(x, y) = \frac{x y^2}{x^2 + y^4}$ ($f(0, 0) = 0$) has directional derivatives in every direction at $(0, 0)$, yet is discontinuous along the parabola $x = y^2$ where $f(y^2, y) = 1/2 \ne 0$. Differentiability in several variables requires a stronger, linear-algebraic concept: the Fréchet derivative.
3. The Total Fréchet Derivative
Definition 8.4 (Total Derivative / Fréchet Derivative): Let $U \subseteq \mathbb{R}^n$ be open, $\mathbf{f}: U \to \mathbb{R}^m$, and $\mathbf{x}_0 \in U$. The function $\mathbf{f}$ is differentiable at $\mathbf{x}_0$ if there exists a linear transformation $T: \mathbb{R}^n \to \mathbb{R}^m$ (denoted $D\mathbf{f}(\mathbf{x}_0)$) such that:
Equivalently:
Theorem 8.2 (Differentiability Implies Continuity): If $\mathbf{f}$ is differentiable at $\mathbf{x}_0$, then $\mathbf{f}$ is continuous at $\mathbf{x}_0$.
§8.3 The Jacobian Matrix, Multivariable Chain Rule & C^1 Functions
1. Matrix Representation: The Jacobian Matrix
Theorem 8.3 (Uniqueness of Derivative & Jacobian Representation): If $\mathbf{f} = (f_1, f_2, \dots, f_m)^T: U \subseteq \mathbb{R}^n \to \mathbb{R}^m$ is differentiable at $\mathbf{x}_0$, then all partial derivatives $\frac{\partial f_i}{\partial x_j}(\mathbf{x}_0)$ exist, and the matrix representation of $D\mathbf{f}(\mathbf{x}_0)$ with respect to the standard bases is the $m \times n$ Jacobian matrix:
That is, $D\mathbf{f}(\mathbf{x}_0)(\mathbf{h}) = J_{\mathbf{f}}(\mathbf{x}_0) \mathbf{h}$.
2. Sufficient Condition for Differentiability ($C^1$)
Theorem 8.4 (Continuously Differentiable implies Differentiable): Let $U \subseteq \mathbb{R}^n$ be open and $\mathbf{f}: U \to \mathbb{R}^m$. If all partial derivatives $\frac{\partial f_i}{\partial x_j}$ exist on $U$ and are continuous at $\mathbf{x}_0$ (i.e., $\mathbf{f} \in C^1(U)$), then $\mathbf{f}$ is differentiable at $\mathbf{x}_0$.
Proof:
By considering each component function $f_i$ separately, it suffices to prove this for $f: U \subseteq \mathbb{R}^n \to \mathbb{R}$. Let $\mathbf{h} = (h_1, h_2, \dots, h_n)$. Express the difference $f(\mathbf{x}_0 + \mathbf{h}) - f(\mathbf{x}_0)$ as a telescoping sum across coordinate axes:
In each step, only the $j$-th coordinate varies. By the single-variable Mean Value Theorem (Theorem 6.6), there exists $\theta_j \in (0, 1)$ such that:
where $\mathbf{p}_j$ lies on the line segment between $\mathbf{x}_0$ and $\mathbf{x}_0 + \mathbf{h}$. Now subtract the candidate linear approximation $\sum_{j=1}^n \frac{\partial f}{\partial x_j}(\mathbf{x}_0) h_j$:
Since $|h_j| \le \|\mathbf{h}\|$, the ratio $\frac{|h_j|}{\|\mathbf{h}\|} \le 1$. As $\mathbf{h} \to \mathbf{0}$, $\mathbf{p}_j \to \mathbf{x}_0$. Since each partial derivative is continuous at $\mathbf{x}_0$, $\left| \frac{\partial f}{\partial x_j}(\mathbf{p}_j) - \frac{\partial f}{\partial x_j}(\mathbf{x}_0) \right| \to 0$. Thus the error quotient vanishes as $\mathbf{h} \to \mathbf{0}$. Therefore, $f$ is differentiable at $\mathbf{x}_0$. $\blacksquare$
3. The Multivariable Chain Rule
Theorem 8.5 (Multivariable Chain Rule): Let $U \subseteq \mathbb{R}^n$ and $V \subseteq \mathbb{R}^m$ be open sets. If $\mathbf{f}: U \to V$ is differentiable at $\mathbf{x}_0 \in U$ and $\mathbf{g}: V \to \mathbb{R}^p$ is differentiable at $\mathbf{y}_0 = \mathbf{f}(\mathbf{x}_0) \in V$, then the composite mapping $\mathbf{h} = \mathbf{g} \circ \mathbf{f}: U \to \mathbb{R}^p$ is differentiable at $\mathbf{x}_0$, and:
In matrix notation:
The Jacobian matrix of a composite function is the matrix product of their respective Jacobian matrices!
§8.4 The Inverse Function Theorem & The Implicit Function Theorem in R^n
1. The Inverse Function Theorem
The Inverse Function Theorem provides the definitive criterion under which a non-linear mapping can be locally inverted, generalizing the 1D condition $f'(x_0) \ne 0$.
Theorem 8.6 (Inverse Function Theorem): Let $U \subseteq \mathbb{R}^n$ be an open set and let $\mathbf{f}: U \to \mathbb{R}^n$ be a continuously differentiable ($C^1$) mapping. Suppose that at a point $\mathbf{x}_0 \in U$, the total derivative $D\mathbf{f}(\mathbf{x}_0)$ is invertible:
Then:
- There exists an open neighborhood $V$ containing $\mathbf{x}_0$ and an open neighborhood $W$ containing $\mathbf{y}_0 = \mathbf{f}(\mathbf{x}_0)$ such that $\mathbf{f}: V \to W$ is a bijection (a local $C^1$-diffeomorphism).
- The inverse function $\mathbf{g} = \mathbf{f}^{-1}: W \to V$ is also continuously differentiable ($C^1$).
- For every $\mathbf{y} \in W$, the derivative of the inverse is the matrix inverse of the derivative:
2. The Implicit Function Theorem
In applications, equations often define variables implicitly, such as $F(x, y, z) = 0$. Under what conditions can we solve for some variables in terms of the others: $z = g(x, y)$?
Theorem 8.7 (Implicit Function Theorem): Let $U \subseteq \mathbb{R}^n \times \mathbb{R}^m$ be open, and let $\mathbf{F}: U \to \mathbb{R}^m$ be a $C^1$ function, with coordinates $(\mathbf{x}, \mathbf{y}) = (x_1, \dots, x_n, y_1, \dots, y_m)$. Suppose $(\mathbf{x}_0, \mathbf{y}_0) \in U$ satisfies:
- $\mathbf{F}(\mathbf{x}_0, \mathbf{y}_0) = \mathbf{0}$.
- The $m \times m$ partial Jacobian matrix with respect to $\mathbf{y}$ is invertible:
Then:
- There exists an open neighborhood $V \subseteq \mathbb{R}^n$ of $\mathbf{x}_0$ and an open neighborhood $W \subseteq \mathbb{R}^m$ of $\mathbf{y}_0$ such that for each $\mathbf{x} \in V$, there exists a unique $\mathbf{y} = \mathbf{g}(\mathbf{x}) \in W$ satisfying:
- The function $\mathbf{g}: V \to W$ is continuously differentiable ($C^1$).
- The derivative of $\mathbf{g}$ is given by:
§8.5 Multiple Integrals, Fubini's Theorem & Change of Variables
1. Multiple Integrals in $\mathbb{R}^n$
Let $R = [a_1, b_1] \times [a_2, b_2] \times \dots \times [a_n, b_n]$ be a compact $n$-dimensional rectangle (box) in $\mathbb{R}^n$. Partitions $P = P_1 \times \dots \times P_n$ divide $R$ into sub-rectangles $R_k$ of volume $\operatorname{vol}(R_k) = \prod_{j=1}^n \Delta x_{j, k}$. Darboux upper and lower sums are defined analogously:
A bounded function $f: R \to \mathbb{R}$ is Riemann integrable if $\inf U(f, P) = \sup L(f, P)$, denoted $\int_R f(\mathbf{x}) \, d\mathbf{x}$.
2. Fubini's Theorem: Reduction to Iterated Integrals
Theorem 8.8 (Fubini's Theorem for Continuous Functions): Let $A \subset \mathbb{R}^n$ and $B \subset \mathbb{R}^m$ be compact rectangles, and let $f: A \times B \to \mathbb{R}$ be continuous. Then:
The multiple integral equals the iterated single integrals, and the order of integration can be freely interchanged.
3. The Multivariable Change of Variables Theorem
Theorem 8.9 (Change of Variables Theorem in $\mathbb{R}^n$): Let $U \subseteq \mathbb{R}^n$ be open, and let $\mathbf{g}: U \to \mathbb{R}^n$ be an injective $C^1$ mapping such that $\det J_{\mathbf{g}}(\mathbf{u}) \ne 0$ for all $\mathbf{u} \in U$. Let $E \subset U$ be a compact Jordan-measurable set, and let $f: \mathbf{g}(E) \to \mathbb{R}$ be continuous. Then:
The absolute value of the Jacobian determinant $|\det J_{\mathbf{g}}(\mathbf{u})|$ represents the local volume distortion factor under the non-linear transformation $\mathbf{g}$.
Step-by-step rigorous derivations with unskipped proofs, categorized into Foundational Concepts, Advanced Structural Analysis, and Honors / Proof Challenge tiers.
Consider the vector-valued function $\mathbf{f}: \mathbb{R}^2 \to \mathbb{R}^2$ defined by:
- Compute all four first-order partial derivatives $\frac{\partial f_i}{\partial x_j}$ for $(x, y) \in \mathbb{R}^2$.
- Form the Jacobian matrix $J_{\mathbf{f}}(x, y)$ and evaluate it at the point $\mathbf{x}_0 = (1, 0)$.
- Compute the linear Fréchet approximation $D\mathbf{f}(1, 0)(\mathbf{h})$ for $\mathbf{h} = (h_1, h_2)^T$ and approximate $\mathbf{f}(1.02, -0.01)$.
1. Partial Derivatives Computation
Let $f_1(x, y) = e^{x y}$ and $f_2(x, y) = \sin(x^2 + y^2)$.
- Component 1:
- Component 2:
2. Jacobian Matrix Formation and Evaluation at $(1, 0)$
The general Jacobian matrix is:
Evaluating at $\mathbf{x}_0 = (1, 0)$:
3. Fréchet Linear Approximation
The Fréchet differential applied to $\mathbf{h} = (h_1, h_2)^T$ is:
The first-order affine approximation is:
For $\mathbf{x} = (1.02, -0.01)$, the displacement is $\mathbf{h} = (0.02, -0.01)^T$:
Using $\sin(1) \approx 0.84147$ and $\cos(1) \approx 0.54030$:
Provide a complete, self-contained proof of the Multivariable Chain Rule (Theorem 8.5): Let $\mathbf{f}: U \subseteq \mathbb{R}^n \to \mathbb{R}^m$ be differentiable at $\mathbf{x}_0 \in U$, and let $\mathbf{g}: V \subseteq \mathbb{R}^m \to \mathbb{R}^p$ be differentiable at $\mathbf{y}_0 = \mathbf{f}(\mathbf{x}_0) \in V$. Prove that $\mathbf{h} = \mathbf{g} \circ \mathbf{f}$ is differentiable at $\mathbf{x}_0$, and:
1. Setting Up Linear Approximations and Remainder Terms
Let $A = D\mathbf{f}(\mathbf{x}_0) \in \mathcal{L}(\mathbb{R}^n, \mathbb{R}^m)$ and $B = D\mathbf{g}(\mathbf{y}_0) \in \mathcal{L}(\mathbb{R}^m, \mathbb{R}^p)$. By differentiability of $\mathbf{f}$ at $\mathbf{x}_0$:
Let $\mathbf{k} = \mathbf{f}(\mathbf{x}_0 + \mathbf{h}) - \mathbf{f}(\mathbf{x}_0) = A \mathbf{h} + \mathbf{r}_1(\mathbf{h})$. Since differentiability implies continuity (Theorem 8.2), $\lim_{\mathbf{h} \to \mathbf{0}} \mathbf{k} = \mathbf{0}$. By differentiability of $\mathbf{g}$ at $\mathbf{y}_0$:
Define the error rate function $\eta(\mathbf{k})$ for $\mathbf{k} \ne \mathbf{0}$ by $\eta(\mathbf{k}) = \frac{\|\mathbf{r}_2(\mathbf{k})\|}{\|\mathbf{k}\|}$ and $\eta(\mathbf{0}) = 0$. Then $\lim_{\mathbf{k} \to \mathbf{0}} \eta(\mathbf{k}) = 0$, and $\|\mathbf{r}_2(\mathbf{k})\| = \eta(\mathbf{k}) \|\mathbf{k}\|$ for all $\mathbf{k}$.
2. Expanding the Composite Difference
Now examine the composite increment:
The candidate derivative is the linear operator $B A = D\mathbf{g}(\mathbf{y}_0) \circ D\mathbf{f}(\mathbf{x}_0)$. The total error term is:
3. Rigorous Error Bound Verification
We must show that $\lim_{\mathbf{h} \to \mathbf{0}} \frac{\|\mathbf{R}(\mathbf{h})\|}{\|\mathbf{h}\|} = 0$. Applying the Triangle Inequality:
- First term: By the operator norm bound $\|B \mathbf{v}\| \le \|B\|_{\text{op}} \|\mathbf{v}\|$:
- Second term: Recall $\|\mathbf{r}_2(\mathbf{k})\| = \eta(\mathbf{k}) \|\mathbf{k}\|$, so:
Now bound the ratio $\frac{\|\mathbf{k}\|}{\|\mathbf{h}\|}$:
As $\mathbf{h} \to \mathbf{0}$, $\frac{\|\mathbf{r}_1(\mathbf{h})\|}{\|\mathbf{h}\|} \to 0$, so for all sufficiently small $\mathbf{h}$:
Furthermore, since $\lim_{\mathbf{h} \to \mathbf{0}} \mathbf{k} = \mathbf{0}$, we have $\lim_{\mathbf{h} \to \mathbf{0}} \eta(\mathbf{k}) = 0$. Therefore:
Combining both terms:
This rigorously proves that $\mathbf{h} = \mathbf{g} \circ \mathbf{f}$ is differentiable at $\mathbf{x}_0$, and $D\mathbf{h}(\mathbf{x}_0) = D\mathbf{g}(\mathbf{y}_0) \circ D\mathbf{f}(\mathbf{x}_0)$. $\blacksquare$
- State the Implicit Function Theorem for a scalar equation $F(x, y) = 0$ in $\mathbb{R}^2$.
- Provide a rigorous, complete proof using the Mean Value Theorem, Bolzano's Intermediate Value Theorem, and the single-variable Inverse Function Theorem.
- Apply the theorem to the algebraic equation:
at the point $(x_0, y_0) = \left(\frac{3}{2}, \frac{3}{2}\right)$. Verify that $y$ can be expressed as a function of $x$ and compute $\frac{dy}{dx}$ at that point.
1. Statement of the Implicit Function Theorem in $\mathbb{R}^2$
Let $U \subseteq \mathbb{R}^2$ be open, and let $F: U \to \mathbb{R}$ be $C^1(U)$. Suppose $(x_0, y_0) \in U$ satisfies:
- $F(x_0, y_0) = 0$.
- $\frac{\partial F}{\partial y}(x_0, y_0) \ne 0$.
Then there exists an open interval $I = (x_0 - \delta, x_0 + \delta)$ and an open interval $J = (y_0 - \epsilon, y_0 + \epsilon)$ such that for every $x \in I$, there exists a unique $y = g(x) \in J$ satisfying $F(x, g(x)) = 0$. Furthermore, $g: I \to J$ is $C^1$ and:
2. Rigorous Proof
Assume without loss of generality that $\frac{\partial F}{\partial y}(x_0, y_0) > 0$.
- Step 1: Constructing the isolator rectangle.
Since $F \in C^1$, $\frac{\partial F}{\partial y}$ is continuous. There exists $\epsilon > 0$ such that $\frac{\partial F}{\partial y}(x_0, y) > 0$ for all $y \in [y_0 - \epsilon, y_0 + \epsilon]$. Thus the one-variable function $y \mapsto F(x_0, y)$ is strictly increasing on $[y_0 - \epsilon, y_0 + \epsilon]$. Since $F(x_0, y_0) = 0$:
By continuity of $x \mapsto F(x, y)$, there exists $\delta > 0$ such that for all $x \in (x_0 - \delta, x_0 + \delta)$:
Furthermore, choose $\delta$ small enough that $\frac{\partial F}{\partial y}(x, y) > 0$ on the entire rectangle $R = (x_0 - \delta, x_0 + \delta) \times [y_0 - \epsilon, y_0 + \epsilon]$.
- Step 2: Existence and uniqueness of $g(x)$.
Fix any $x \in (x_0 - \delta, x_0 + \delta)$. The function $y \mapsto F(x, y)$ is continuous on $[y_0 - \epsilon, y_0 + \epsilon]$ and takes values of opposite signs at the endpoints: $F(x, y_0 - \epsilon) < 0 < F(x, y_0 + \epsilon)$. By Bolzano's Intermediate Value Theorem (Theorem 5.6), there exists at least one $y \in (y_0 - \epsilon, y_0 + \epsilon)$ such that $F(x, y) = 0$. Since $\frac{\partial F}{\partial y} > 0$ on $R$, $y \mapsto F(x, y)$ is strictly increasing, so this zero is unique! Define $g(x) = y$.
- Step 3: Differentiability of $g(x)$.
Let $x, x + h \in (x_0 - \delta, x_0 + \delta)$ and let $k = g(x + h) - g(x)$. Then $F(x + h, g(x) + k) = 0$ and $F(x, g(x)) = 0$. By the multivariable Mean Value Theorem:
where $(\xi, \eta)$ lies on the segment connecting $(x, g(x))$ and $(x+h, g(x)+k)$. Solving for the difference quotient:
As $h \to 0$, $k \to 0$ by continuity, so $(\xi, \eta) \to (x, g(x))$. Since the partial derivatives are continuous and $\frac{\partial F}{\partial y} \ne 0$:
3. Application to the Folium of Descartes
$F(x, y) = x^3 + y^3 - 3 x y = 0$ at $\left(\frac{3}{2}, \frac{3}{2}\right)$. Verify the point satisfies the equation:
Compute partial derivatives:
Evaluating at $(x_0, y_0) = (3/2, 3/2)$:
Since $\frac{\partial F}{\partial y} = \frac{9}{4} \ne 0$, the hypotheses of the Implicit Function Theorem are satisfied. Thus $y$ can be expressed as a unique $C^1$ function $y = g(x)$ in a neighborhood of $x = 3/2$. The derivative is: