18 个回答
【长篇符咒预警~慎点!回答本题,纯粹是因为这题勾起了我由来已久欲一吐为快之槽……请原谅我的无聊。。。】
陶哲轩的《分析》一书中,居然把这个证明留成了一道课后习题……还要求用他书中的体系(最“老土”的牛顿逼近法)去证……真是要多特么蛋疼有多特么蛋疼。。。简直丧病啊!
定理 10.1.15( 复合函数的求导——链式法则 ) :设 X,Y \subset \mathbb{R} , x_0 \in X 是 X 的极限点,并设 y_0 \in Y 是 Y 的极限点。设 f:X \rightarrow Y 是在 x_0 处可微的函数且 f\left( x_0 \right)=y_0 , g:Y \rightarrow \mathbb{R} 是在 y_0 处可微的函数;则两者的复合 g \ \circ f: X \rightarrow \mathbb{R} 在 x_0 处可微,且 \left( \ g \circ f \ \right)^{\prime} \left( x_0 \right)=g^\prime \left(y_0\right) \cdot f^{\prime} \left( x_0 \right) 。
证明 (所需命题序号引自陶哲轩书,可直接查看,故不一一赘述) :依命题10.1.7(牛顿逼近)以及命题10.1.10(可微性蕴含连续性),可立即得出以下三个条件(1、3用10.1.7;2用10.1.10):
- \forall \varepsilon>0, \exists \delta_1>0:\left| x-x_0\right|<\delta_1 \Rightarrow\left| f\left(x\right) - \left[f\left(x_0\right)+f^\prime\left( x_0\right)\cdot\left(x-x_0\right)\right]\right|<\varepsilon\cdot\left|x-x_0\right| ;
2. \forall \delta^\prime>0, \exists\delta_2>0: \left|x-x_0\right|<\delta_2 \Rightarrow \left|f\left(x\right)-f\left(x_0\right)\right|<\delta^\prime ;而由此可推出——
3.
\begin{align} &\forall\epsilon>0, \exists \delta^{\prime\prime}>0:\left|f\left(x\right)-f\left(x_0\right)\right|<\delta^{\prime\prime}\Rightarrow \\& \left| g\left(f\left(x\right)\right) -\left[g\left(f\left(x_0\right)\right)+g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)\right]\right|<\epsilon\cdot\left|f\left(x\right)-f\left(x_0\right)\right| \end{align}
。
先对1式后半部用三角不等式的变形: \left| a \right|-\left| b \right| <\left| a-b \right| ,代入 a=f\left(x\right) - f\left(x_0\right), b = f^\prime \left(x_0\right)\left(x-x_0\right) ,即有 \left|f\left(x\right) - f\left(x_0\right)\right| - \left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|<\varepsilon \cdot \left|x-x_0\right| (此处还用到 \left|ab\right|=\left|a\right|\cdot\left|b\right| )。
再对1式后半部使用 \left|a-b\right|<k \Leftrightarrow b-k<a<b+k (令 a=f\left(x\right)-f\left(x_0\right), b = f^\prime\left(x_0\right)\left(x-x_0\right) ),得到 f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon\cdot\left|x-x_0\right|<f\left(x\right)-f\left(x_0\right)<f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon\cdot\left|x-x_0\right| 。将同样方法应用至3式后半部,得——
\begin{align} & g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)-\epsilon\cdot\left|f\left(x\right)-f\left(x_0\right)\right| \\&<g\left(f\left(x\right)\right) -g\left(f\left(x_0\right)\right) \\&<g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)+\epsilon\cdot\left|f\left(x\right)-f\left(x_0\right)\right| \end{align}
稍作整理,得:
\left|f\left(x\right) - f\left(x_0\right)\right|<\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right| —— ①
f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon\cdot\left|x-x_0\right|<f\left(x\right)-f\left(x_0\right)<f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon\cdot\left|x-x_0\right| —— ②
\begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)-\epsilon\cdot\left|f\left(x\right)-f\left(x_0\right)\right| \\&<g\left(f\left(x\right)\right) -g\left(f\left(x_0\right)\right)\\&<g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)+\epsilon\cdot\left|f\left(x\right)-f\left(x_0\right)\right| \end{align} —— ③
。
现取 \delta<\text{min}\left(\delta_1, \delta_2,\delta^\prime,\delta^{\prime\prime}\right) ,则当 \left|x-x_0\right|<\delta 时,①、②、③式同时成立。将①式右边取代③中的 \left|f\left(x\right) - f\left(x_0\right)\right| ,得 ——
\begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)-\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \\&<g\left(f\left(x\right)\right) -g\left(f\left(x_0\right)\right)\\&<g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right)+\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \end{align} ——④
。
以下分两种情况进行讨论——
一、 g^\prime\left(f\left(x_0\right)\right) \geq 0 :此时用 g^\prime\left(f\left(x_0\right)\right) 乘②,序关系不变(仅当 g^\prime\left(f\left(x_0\right)\right)=0 时需将 < 换为
\leq 以保持严谨),有:
\begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right|\\ &\leq g^\prime\left(f\left(x_0\right)\right)\cdot\left[f\left(x\right)-f\left(x_0\right)\right]\\ &\leq g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right| \end{align} ——⑤
。以⑤的左端取代④式左端 g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right) 一项,以⑤的右端取代④式右端 g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right) 一项,这样并不改变④之原有的序关系,得到——
\begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right|-\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \\ &\leq g\left(f\left(x\right)\right) -g\left(f\left(x_0\right)\right)\\ &\leq g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right|+\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \end{align} 。
整理(重新合并同类项,并使用 \left|a-b\right|<k \Leftrightarrow b-k<a<b+k ),得 \left|g\left(f\left(x\right)\right)-\left[g\left(f\left(x_0\right)\right)+g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)\right]\right|\leq \left[\varepsilon g^\prime\left(f\left(x_0\right)\right)+\epsilon \left|f^\prime\left(x_0\right)\right|+\varepsilon \epsilon\right]\cdot\left|x-x_0\right| ——(A)。
二、 g^\prime\left(f\left(x_0\right)\right) < 0 :此时用 g^\prime\left(f\left(x_0\right)\right) 乘②,序关系反号(向),有: \begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right| \\&<g^\prime\left(f\left(x_0\right)\right)\cdot\left[f\left(x\right)-f\left(x_0\right)\right]\\&<g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right| \end{align} ——⑥
。以⑥的左端取代④式左端 g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right) 一项,以⑥的右端取代④式右端 g^\prime\left(f\left(x_0\right)\right)\cdot\left(f\left(x\right)-f\left(x_0\right)\right) 一项,这样并不改变④之原有的序关系,得到——
\begin{align} &g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)+\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right|-\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \\&<g\left(f\left(x\right)\right) -g\left(f\left(x_0\right)\right)\\&<g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)-\varepsilon g^\prime\left(f\left(x_0\right)\right)\cdot\left|x-x_0\right|+\epsilon\cdot\left[\left| f^\prime \left(x_0\right)\right|\cdot\left|\left(x-x_0\right)\right|+\varepsilon \cdot \left|x-x_0\right|\right] \end{align} 。
整理(重新合并同类项,并使用 \left|a-b\right|<k \Leftrightarrow b-k<a<b+k ,考虑到 g^\prime\left(f\left(x_0\right)\right) < 0,\varepsilon>0 ,则 -\varepsilon g^\prime\left(f\left(x_0\right)\right) > 0 ,下式不等号右端有意义),得 \left|g\left(f\left(x\right)\right)-\left[g\left(f\left(x_0\right)\right)+g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)\right]\right|<\left[-\varepsilon g^\prime\left(f\left(x_0\right)\right)+\epsilon \left|f^\prime\left(x_0\right)\right|+\varepsilon \epsilon\right]\cdot\left|x-x_0\right| ——(B)。
考虑到 \varepsilon\left|g^\prime\left(f\left(x_0\right)\right) \right|:= \left\{ \begin{array}{ll} \varepsilon g^\prime \left(f\left(x_0\right)\right) & g^\prime \left(f\left(x_0\right)\right)\geq 0 \\ -\varepsilon g^\prime \left(f\left(x_0\right)\right) & g^\prime \left(f\left(x_0\right)\right) < 0 \end{array}\right. ,可以将(A)、(B)两式合二为一:
\left|g\left(f\left(x\right)\right)-\left[g\left(f\left(x_0\right)\right)+g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)\right]\right| \leq \left[\varepsilon \left|g^\prime\left(f\left(x_0\right)\right)\right|+\epsilon \left|f^\prime\left(x_0\right)\right|+\varepsilon \epsilon\right]\cdot\left|x-x_0\right| ——(※)。
现给定 \eta>0 ,令 \varepsilon<\min \left( \frac{\eta}{3}, \frac{\eta}{3\left|g^\prime\left(f\left(x_0\right)\right)\right|}, \frac{2}{3} \right) , \epsilon<\min \left( \frac{\eta}{3}, \frac{\eta}{3\left|f^\prime\left(x_0\right)\right|}, \frac{2}{3} \right) 。这样一来,一方面当 \eta \geq 3 时, \frac{\eta}{3}\geq 1 ,而 \varepsilon<\frac{2}{3} 且 \epsilon<\frac{2}{3} 使得 \varepsilon\epsilon<\frac{4}{9}<1\leq \frac{\eta}{3} ;另一方面,当 \eta < 3 时, \frac{\eta}{3}< 1 ,而 \varepsilon<\frac{\eta}{3} 且 \epsilon<\frac{\eta}{3} 使得 \varepsilon\epsilon<\left(\frac{\eta}{3}\right)\left(\frac{\eta}{3}\right)<\frac{\eta}{3}\cdot 1=\frac{\eta}{3} 。因此, \forall \eta>0 , \varepsilon \left|g^\prime\left(f\left(x_0\right)\right)\right|<\frac{\eta}{3} 且 \epsilon \left|f^\prime\left(x_0\right)\right|<\frac{\eta}{3} 且 \varepsilon\epsilon<\frac{\eta}{3} 。根据1、3两式,存在着 \delta_1,\delta^{\prime\prime}>0 使之针对此处给定的 \eta 依以上估计所构造出的 \varepsilon,\epsilon 成立;而对于 \delta^{\prime\prime}>0 ,依2式知必然存在 \delta_2>0 使之成立。那么,令 \delta<\min\left(\delta_1,\delta_2\right) ,依(※)则有——
\begin{align} &\forall \eta>0, \exists \delta>0: \left|x-x_0\right|<\delta \Rightarrow \left|g\left(f\left(x\right)\right)-\left[g\left(f\left(x_0\right)\right)+g^\prime\left(f\left(x_0\right)\right)\cdot f^\prime\left(x_0\right)\left(x-x_0\right)\right]\right| \\ &\leq \left[\varepsilon \left|g^\prime\left(f\left(x_0\right)\right)\right|+\epsilon \left|f^\prime\left(x_0\right)\right|+\varepsilon \epsilon\right]\cdot\left|x-x_0\right|<\left( \frac{\eta}{3} + \frac{\eta}{3} + \frac{\eta}{3} \right) \cdot \left|x-x_0\right| = \eta \cdot \left|x-x_0\right| \end{align} ,
依命题10.1.7,定理得证。
□
这证明从最基本的导数、微分的极限定义出发,用各种繁琐庞杂的不等式估计式直接正面硬刚,绝对能特么体现出特仑苏在这本书前言中所强调的“冗繁然而构造性”、“‘严格地’、‘手工地’做分析”的精神实质——“暴力”的硬分析(俗称“干脏活儿”、“硬㨃/怼”)。。。
然而公式敲完之后,只觉天旋地转,喉头发痒咸腥,一口老血喷在屏幕上~
顺便说一句,以下“证明”——
\begin{align} \left(g \circ f\right)^\prime\left( x \right) & = \lim_{h\rightarrow 0}\frac{g\left(f\left(x+h\right)\right)-g\left(f\left(x\right)\right)}{h} \\& \stackrel{?}{=} \lim_{h\rightarrow 0}\frac{g\left(f\left(x+h\right)\right)-g\left(f\left(x\right)\right)}{f\left(x+h\right)-f\left(x\right)} \cdot \frac{f\left(x+h\right)-f\left(x\right)}{h} \\&\stackrel{?}{=}\lim_{h\rightarrow 0}\frac{g\left(f\left(x+h\right)\right)-g\left(f\left(x\right)\right)}{f\left(x+h\right)-f\left(x\right)} \cdot \lim_{h\rightarrow 0} \frac{f\left(x+h\right)-f\left(x\right)}{h} \\&\stackrel{?}{=} g^\prime \left(f\left(x\right)\right) \cdot f^\prime \left(x\right) \end{align}
是众所周知的伪证,因为分母 f\left(x+h\right)-f\left(x\right) 在 h\neq0 时仍然可以为零。然而,很多人 误认为 f 的 连续性 可以保证 \exists \delta>0 使得 \left|h\right|<\delta\Rightarrow f\left(x+h\right)-f\left(x\right) \neq 0 ,但——
这是错误的!
然后很多人又会 误以为只有 常数函数 f\left(x\right) \equiv c \in \mathbb{R} 才会导致这样的bug出现 ,然而——
这也是妄念!
考虑以下函数,这是关于可微性的经典反例——
f\left(x\right):=\left\{ \begin{array}{ll} x^2\sin\left(\frac{1}{x}\right) & x\neq 0 \\ 0 & x=0 \end{array}\right. ,立即打脸。
所以说,纵使这个伪证中存在的bug本质上是个“佯谬”,但也得认真对待——弄得不好,纸老虎也是会咬人的。
{{\rm{d}} \over {{\rm{d}}x}}f\left[ {g\left( x \right)} \right] = \mathop {\lim }\limits_{h \to 0} {{f\left[ {g\left( {x + h} \right)} \right] - f\left[ {g\left( x \right)} \right]} \over h}
因为 g(x) 在点 x 可导,令
v = {{g\left( {x + h} \right) - g\left( x \right)} \over h} - g'\left( x \right)
则
g\left( {x + h} \right) = g\left( x \right) + \left[ {v + g'\left( x \right)} \right]h
且有 \mathop {\lim }\limits_{h \to 0} v = 0
同理,对函数 f(u) ,
f\left( {y + k} \right) = f\left( y \right) + \left[ {w + f'\left( y \right)} \right]k \\ \mathop {\lim }\limits_{h \to 0} w = 0,
特别地,令 y=g(x),k=[v+g'(x)]h ,则
f\left( {g\left( x \right) + \left[ {v + g'\left( x \right)} \right]h} \right) = f\left[ {g\left( x \right)} \right] + \left[ {w + f'\left( y \right)} \right]\left[ {v + g'\left( x \right)} \right]h
\eqalign{ & f\left( {\left[ {g\left( {x + h} \right)} \right]} \right) - f\left[ {g\left( x \right)} \right] \cr & = f\left( {g\left( x \right) + \left[ {v + g'\left( x \right)} \right]h} \right) - f\left[ {g\left( x \right)} \right] \cr & = f\left[ {g\left( x \right)} \right] + \left[ {w + f'\left( y \right)} \right]\left[ {v + g'\left( x \right)} \right]h - f\left[ {g\left( x \right)} \right] \cr & = \left[ {w + f'\left( y \right)} \right]\left[ {v + g'\left( x \right)} \right]h \cr}
\eqalign{ & {{\rm{d}} \over {{\rm{d}}x}}f\left[ {g\left( x \right)} \right] \cr & = \mathop {\lim }\limits_{h \to 0} {{f\left[ {g\left( {x + h} \right)} \right] - f\left[ {g\left( x \right)} \right]} \over h} \cr & = \mathop {\lim }\limits_{h \to 0} \left[ {w + f'\left( y \right)} \right]\left[ {v + g'\left( x \right)} \right] \cr & = f'\left( y \right)g'\left( x \right) \cr & = f'\left[ {g\left( x \right)} \right]g'\left( x \right) \cr & = f'\left( u \right)g'\left( x \right) \cr}