TheoremBase

Sketch: the constant, affine and coordinate rules have zero remainder; sums and scalar multiples split the tolerance; the product rule uses a three-term remainder identity and the increment bound; the quotient rule is the product rule applied to f and 1/g.

Proof

Throughout, the arithmetic and order of R\mathbb{R} are used through The Structure of ℝ as a Field and an Ordered Ring (i), The Structure of ℝ as a Field and an Ordered Ring (ii), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (v), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (ix), Rules of Arithmetic and Order in an Ordered Field (iii) and The Quotient 1/x, Order Rules for Sums, and Nesting of Closed Intervals in ℝ (i); norms and distances in Rn\mathbb{R}^{n} through Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (ii), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Standard Basis Vectors of ℝ^q: Coordinates, Orthonormality and Unit Length (iii); and the metric spaces (Rn,dE)(\mathbb{R}^{n},d_{E}) and (R,dR)(\mathbb{R},d_{\mathbb{R}}) through Rn\mathbb{R}^n with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence (i) and The Absolute Value Metric on the Real Numbers (i).

In every clause we exhibit a derivative matrix in the sense of Differentiability at a Point for Functions Between Euclidean Spaces (i), or a derivative vector in the sense of Differentiability at a Point for Functions Between Euclidean Spaces (ii). That this matrix is Df(a)Df(a) is then The Derivative Is the Jacobian Matrix, and Is Unique (ii), and that this vector is ∇f(a)\nabla f(a) is The Derivative Is the Jacobian Matrix, and Is Unique (i); so it suffices in each case to bound the remainder of the candidate. Conversely, a function differentiable at aa has Df(a)Df(a), respectively ∇f(a)\nabla f(a), as a derivative matrix, respectively derivative vector, by The Derivative Is the Jacobian Matrix, and Is Unique (ii), respectively The Derivative Is the Jacobian Matrix, and Is Unique (i); this is how AA, BB, uu and ww are used below.

Constant and affine functions ((i), (ii)). Since UU is open (Open Subset of a Metric Space (i)), there is δ>0\delta>0 with B(a,δ)⊆UB(a,\delta)\subseteq U, and every h∈Rnh\in\mathbb{R}^{n} with ∥h∥<δ\lVert h\rVert<\delta has dE(a+h,a)=∥h∥<δd_{E}(a+h,a)=\lVert h\rVert<\delta, hence a+h∈Ua+h\in U. We show that for such hh the remainder vanishes identically, so that this one δ\delta serves for every ε>0\varepsilon>0. For the constant function f(x)=cf(x)=c and the candidate 0m×n0_{m\times n},

f(a+h)−f(a)−0m×nh=c−c−0m×nh=0,f(a+h)-f(a)-0_{m\times n}h=c-c-0_{m\times n}h=0,

because 0m×nh=(0 0m×n)h=0 (0m×nh)=00_{m\times n}h=(0\,0_{m\times n})h=0\,(0_{m\times n}h)=0 by the rule (sA)x=s(Ax)(sA)x=s(Ax) of Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v). For the constant function φ(x)=c\varphi(x)=c and the candidate 0∈Rn0\in\mathbb{R}^{n} the remainder is −0⋅h-0\cdot h, and 0⋅h=(0 0)⋅h=0 (0⋅h)=00\cdot h=(0\,0)\cdot h=0\,(0\cdot h)=0 by The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (ii). For f(x)=Bx+cf(x)=Bx+c and the candidate BB, distributivity of the matrix-vector product (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)) gives

f(a+h)−f(a)−Bh=(B(a+h)+c)−(Ba+c)−Bh=0,f(a+h)-f(a)-Bh=\bigl(B(a+h)+c\bigr)-(Ba+c)-Bh=0,

and for φ(x)=v⋅x+c\varphi(x)=v\cdot x+c and the candidate vv, linearity of the dot product in its second argument (The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (iii)) gives

φ(a+h)−φ(a)−v⋅h=(v⋅(a+h)+c)−(v⋅a+c)−v⋅h=0.\varphi(a+h)-\varphi(a)-v\cdot h=\bigl(v\cdot(a+h)+c\bigr)-(v\cdot a+c)-v\cdot h=0 .

Coordinate functions ((iii)). For x∈Ux\in U we have πi(x)=xi=ei⋅x\pi_{i}(x)=x_{i}=e_{i}\cdot x (Standard Basis Vectors of ℝ^q: Coordinates, Orthonormality and Unit Length (i)), so πi\pi_{i} is the affine function x↦v⋅x+cx\mapsto v\cdot x+c with v=eiv=e_{i} and c=0c=0, and (ii) gives ∇πi(a)=ei\nabla\pi_{i}(a)=e_{i}.

Sums and scalar multiples ((iv)). Let A=Df(a)A=Df(a) and B=Dg(a)B=Dg(a) be the derivative matrices of ff and gg at aa. Given ε>0\varepsilon>0, choose δf>0\delta_{f}>0 for ff and δg>0\delta_{g}>0 for gg by Differentiability at a Point for Functions Between Euclidean Spaces (i) with tolerance ε/2\varepsilon/2, and put δ=min⁡(δf,δg)\delta=\min(\delta_{f},\delta_{g}). For ∥h∥<δ\lVert h\rVert<\delta we have a+h∈Ua+h\in U, and since (A+B)h=Ah+Bh(A+B)h=Ah+Bh (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)) the remainder of f+gf+g for the candidate A+BA+B is the sum of the remainders of ff and gg; the triangle inequality (Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi)) gives

∥(f+g)(a+h)−(f+g)(a)−(A+B)h∥≤∥f(a+h)−f(a)−Ah∥+∥g(a+h)−g(a)−Bh∥≤ε∥h∥.\bigl\lVert(f+g)(a+h)-(f+g)(a)-(A+B)h\bigr\rVert\le\lVert f(a+h)-f(a)-Ah\rVert+\lVert g(a+h)-g(a)-Bh\rVert\le\varepsilon\lVert h\rVert .

For λf\lambda f and the candidate λA\lambda A, given ε>0\varepsilon>0 choose δ>0\delta>0 for ff with tolerance ε/(∣λ∣+1)\varepsilon/(|\lambda|+1). Since (λA)h=λ(Ah)(\lambda A)h=\lambda(Ah) (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)), the remainder of λf\lambda f is λ\lambda times that of ff, and by homogeneity of the norm (Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v)), for ∥h∥<δ\lVert h\rVert<\delta,

∥λf(a+h)−λf(a)−(λA)h∥=∣λ∣ ∥f(a+h)−f(a)−Ah∥≤∣λ∣ ε∣λ∣+1∥h∥≤ε∥h∥.\bigl\lVert\lambda f(a+h)-\lambda f(a)-(\lambda A)h\bigr\rVert=|\lambda|\,\lVert f(a+h)-f(a)-Ah\rVert\le\frac{|\lambda|\,\varepsilon}{|\lambda|+1}\lVert h\rVert\le\varepsilon\lVert h\rVert .

Sums and scalar multiples, real-valued ((v)). The argument is the same, with u=∇f(a)u=\nabla f(a) and w=∇g(a)w=\nabla g(a), the candidates u+wu+w for f+gf+g and λu\lambda u for λf\lambda f, the identities

(u+w)⋅h=u⋅h+w⋅h,(λu)⋅h=λ(u⋅h)(u+w)\cdot h=u\cdot h+w\cdot h,\qquad(\lambda u)\cdot h=\lambda(u\cdot h)

of The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (ii) in place of the matrix rules, and the triangle inequality ∣α+β∣≤∣α∣+∣β∣|\alpha+\beta|\le|\alpha|+|\beta| for real α,β\alpha,\beta (Rules of Arithmetic and Order in an Ordered Field (xi)) in place of that for the norm.

Products ((vi)). Let u=∇f(a)u=\nabla f(a) and w=∇g(a)w=\nabla g(a), and write

rf(h)=f(a+h)−f(a)−u⋅h,rg(h)=g(a+h)−g(a)−w⋅hr_{f}(h)=f(a+h)-f(a)-u\cdot h,\qquad r_{g}(h)=g(a+h)-g(a)-w\cdot h

for the remainders of ff and gg. Expanding, and using (f(a)w+g(a)u)⋅h=f(a)(w⋅h)+g(a)(u⋅h)\bigl(f(a)w+g(a)u\bigr)\cdot h=f(a)(w\cdot h)+g(a)(u\cdot h) (The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (ii)), the remainder of fgfg for the candidate f(a)w+g(a)uf(a)w+g(a)u splits as

f(a+h)g(a+h)−f(a)g(a)−(f(a)w+g(a)u)⋅h=rf(h) g(a+h)+(u⋅h)(g(a+h)−g(a))+f(a) rg(h).f(a+h)g(a+h)-f(a)g(a)-\bigl(f(a)w+g(a)u\bigr)\cdot h=r_{f}(h)\,g(a+h)+(u\cdot h)\bigl(g(a+h)-g(a)\bigr)+f(a)\,r_{g}(h).

The choices are made in this order. Given ε>0\varepsilon>0, first take δ0>0\delta_{0}>0 from Differentiable Functions Are Continuous (iii) for gg, so that

∣g(a+h)−g(a)∣≤(∥w∥+1)∥h∥(∥h∥<δ0);|g(a+h)-g(a)|\le\bigl(\lVert w\rVert+1\bigr)\lVert h\rVert\qquad(\lVert h\rVert<\delta_{0});

then take δ1>0\delta_{1}>0 for ff by Differentiability at a Point for Functions Between Euclidean Spaces (ii) with tolerance ε/(3(∣g(a)∣+1))\varepsilon/(3(|g(a)|+1)), and δ2>0\delta_{2}>0 for gg with tolerance ε/(3(∣f(a)∣+1))\varepsilon/(3(|f(a)|+1)); finally set

δ=min⁡(δ0,δ1,δ2,1∥w∥+1,ε3(∥u∥+1)(∥w∥+1)).\delta=\min\Bigl(\delta_{0},\delta_{1},\delta_{2},\frac{1}{\lVert w\rVert+1},\frac{\varepsilon}{3(\lVert u\rVert+1)(\lVert w\rVert+1)}\Bigr).

Let ∥h∥<δ\lVert h\rVert<\delta. Then a+h∈Ua+h\in U, and ∣g(a+h)−g(a)∣<1|g(a+h)-g(a)|<1, so ∣g(a+h)∣≤∣g(a)∣+1|g(a+h)|\le|g(a)|+1; moreover ∣u⋅h∣≤∥u∥ ∥h∥|u\cdot h|\le\lVert u\rVert\,\lVert h\rVert by the Cauchy--Schwarz inequality (The Cauchy-Schwarz Inequality on Rn\mathbb{R}^n (i)). Hence the three terms are bounded by

∣rf(h)∣ ∣g(a+h)∣≤ε3∥h∥,∣u⋅h∣ ∣g(a+h)−g(a)∣≤∥u∥(∥w∥+1)∥h∥ δ≤ε3∥h∥,∣f(a)∣ ∣rg(h)∣≤ε3∥h∥,|r_{f}(h)|\,|g(a+h)|\le\frac{\varepsilon}{3}\lVert h\rVert,\qquad|u\cdot h|\,|g(a+h)-g(a)|\le\lVert u\rVert\bigl(\lVert w\rVert+1\bigr)\lVert h\rVert\,\delta\le\frac{\varepsilon}{3}\lVert h\rVert,\qquad|f(a)|\,|r_{g}(h)|\le\frac{\varepsilon}{3}\lVert h\rVert,

and the remainder of fgfg is at most ε∥h∥\varepsilon\lVert h\rVert. So fgfg is differentiable at aa with derivative vector f(a)∇g(a)+g(a)∇f(a)f(a)\nabla g(a)+g(a)\nabla f(a).

Reciprocals ((vii)). Let w=∇g(a)w=\nabla g(a) and b=g(a)b=g(a), so b≠0b\neq0; we show that −w/b2-w/b^{2} is a derivative vector of 1/g1/g at aa. With rgr_{g} as above, and since g(a+h)≠0g(a+h)\neq0 whenever a+h∈Ua+h\in U, a direct computation gives

1g(a+h)−1b+w⋅hb2=−rg(h)b g(a+h)+(w⋅h)(g(a+h)−b)b2 g(a+h).\frac{1}{g(a+h)}-\frac{1}{b}+\frac{w\cdot h}{b^{2}}=-\frac{r_{g}(h)}{b\,g(a+h)}+\frac{(w\cdot h)\bigl(g(a+h)-b\bigr)}{b^{2}\,g(a+h)} .

The choices are made in this order. Given ε>0\varepsilon>0, first take δ0>0\delta_{0}>0 from Differentiable Functions Are Continuous (iii) for gg and put δ3=min⁡(δ0,∣b∣/(2(∥w∥+1)))\delta_{3}=\min\bigl(\delta_{0},|b|/(2(\lVert w\rVert+1))\bigr); for ∥h∥<δ3\lVert h\rVert<\delta_{3} this gives ∣g(a+h)−b∣<∣b∣/2|g(a+h)-b|<|b|/2, hence

∣g(a+h)∣≥∣b∣2.|g(a+h)|\ge\frac{|b|}{2}.

Then take δ2>0\delta_{2}>0 for gg by Differentiability at a Point for Functions Between Euclidean Spaces (ii) with tolerance ε∣b∣2/4\varepsilon|b|^{2}/4, and set

δ=min⁡(δ2,δ3,ε∣b∣34(∥w∥+1)2).\delta=\min\Bigl(\delta_{2},\delta_{3},\frac{\varepsilon|b|^{3}}{4(\lVert w\rVert+1)^{2}}\Bigr).

For ∥h∥<δ\lVert h\rVert<\delta, the first term is at most (ε∣b∣2/4)∥h∥/(∣b∣⋅∣b∣/2)=ε2∥h∥(\varepsilon|b|^{2}/4)\lVert h\rVert/(|b|\cdot|b|/2)=\tfrac{\varepsilon}{2}\lVert h\rVert, and, using ∣w⋅h∣≤∥w∥ ∥h∥|w\cdot h|\le\lVert w\rVert\,\lVert h\rVert (The Cauchy-Schwarz Inequality on Rn\mathbb{R}^n (i)), the second is at most

∥w∥ ∥h∥ (∥w∥+1)∥h∥∣b∣3/2≤2(∥w∥+1)2 δ∣b∣3∥h∥≤ε2∥h∥.\frac{\lVert w\rVert\,\lVert h\rVert\,\bigl(\lVert w\rVert+1\bigr)\lVert h\rVert}{|b|^{3}/2}\le\frac{2(\lVert w\rVert+1)^{2}\,\delta}{|b|^{3}}\lVert h\rVert\le\frac{\varepsilon}{2}\lVert h\rVert .

So the remainder is at most ε∥h∥\varepsilon\lVert h\rVert, and ∇(1/g)(a)=−∇g(a)/g(a)2\nabla(1/g)(a)=-\nabla g(a)/g(a)^{2}.

Quotients ((viii)). Pointwise f/g=f⋅(1/g)f/g=f\cdot(1/g). By (vii) the function 1/g1/g is differentiable at aa, and (vi) then gives

∇(fg)(a)=f(a)(−1g(a)2∇g(a))+1g(a)∇f(a)=1g(a)2(g(a) ∇f(a)−f(a) ∇g(a)).\nabla\Bigl(\frac{f}{g}\Bigr)(a)=f(a)\Bigl(-\frac{1}{g(a)^{2}}\nabla g(a)\Bigr)+\frac{1}{g(a)}\nabla f(a)=\frac{1}{g(a)^{2}}\bigl(g(a)\,\nabla f(a)-f(a)\,\nabla g(a)\bigr).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…