Loading [MathJax]/jax/output/HTML-CSS/jax.js

数学分析笔记——Higher-order derivatives

数学分析笔记——Higher-order derivatives

We give the natural extension of the theory of differentiability to higher-order derivatives. Organizing the notations turns out to be the main part of the work.

Let U be an open subset of Rn and consider a differentiable mapping f:URp. Then we have for the derivative Df:UL(Rn,Rp)Rpn. If, in turn, Df is differentiable, then its derivative D2f:=D(Df), the second-order derivative of f, is a mapping UL(Rn,L(Rn,Rp))Rpn2. When considering higher-order derivatives, we quickly get a rather involved notation. This becomes more manageable if we recall some results in linear algebra.

Definition. We denote by Lk(Rn,Rp) the linear space of all k-linear map-pings from the k-fold Cartesian product Rn××Rn taking values in Rp. Thus TLk(Rn,Rp) if and only if T:Rn××RnRp and T is linear in each of the k variables varying in Rn, when all the other variables are held fixed.

Lemma. There exists a natural isomorphism of linear spaces
L(Rn,L(Rn,RP))L2(Rn,Rp),


given by L(Rn,L(Rn,Rp))STL2(Rn,Rp) if and only if S(h1)h2=T(h1,h2), for h1,h2Rn.

More generally, there exists a natural isomorphism of linear spaces
L(Rn,L(Rn,,L(Rn,Rp)))Lk(Rn,Rp)(kN{1}),


with ST if and only if (((Sh1)h2))hk=T(h1,h2,,hk), for h1,,hkRn.

Corollary. For every TLk(Rn,Rp) there exists c>0 such that, for all h1,,hkRn,
T(h1,,hk)ch1hk.


Proposition. If TLk(Rn,Rp) then T is differentiable. Furthermore, let (a1,,ak) and (h1,,hk)Rn××Rn, then DT(a1,,ak)L(Rn××Rn,Rp) is given by
DT(a1,,ak)(h1,,hk)=1ikT(a1,,ai1,hi,ai+1,,ak).

Definition. Let f:URp, with U open in Rn. Then the notation fC0(U,Rp) means that f is continuous. By induction over kN we say that f is a k times continuously differentiable mapping, notation fCk(U,Rp), if fCk1(U,Rp) and if the derivative of order k1
Dk1f:UL(Rn,Rp)

is a continuously differentiable mapping. We write fC(U,Rp) if fCk(U,Rp), for all kN. If we want to consider fCk for kN or k=, we write fCk with kN. In the case where p=1, we write Ck(U) instead of Ck(U,Rp).

Rephrasing the definition above, we obtain at once that fCk(U,Rp) if fCk1(U,Rp) and if, for all i1,,ik1{1,,n}, the partial derivative of order k1
Dik1Di1f


belongs to C1(U,Rp). The latter condition is satisfied if all the partial derivatives of order k satisfy
DikDik1Di1f:=Dik(Dik1Di1f)C0(U,Rp).

Clearly, fCk(U,Rp) if and only if
DfCk1(U,L(Rn,Rp)).

This can subsequently be used to prove, by induction over k, that the composition gf is a Ck mapping if f and g are Ck mappings. Indeed, we have D(gf)=((Dg)f)Df on account of the chain rule. Now, (Dg)f is a Ck1 mapping, being a composition of the Ck mapping f with the Ck1 mapping Dg, where we use the induction hypothesis. Furthermore, Df is a Ck1 mapping, and composition of linear mappings is infinitely differentiable. Hence we obtain that D(gf) is a Ck1 mapping.

Theorem. If URn is open and fC2(U,Rp), then the bilinear mapping D2f(a)L2(Rn,Rp) satisfies
D2f(a)(h1,h2)=(Dh1Dh2f)(a)(a,h1,h2Rn).


Furthermore, D2f(a) is symmetric, that is,
D2f(a)(h1,h2)=D2f(a)(h2,h1)(a,h1,h2Rn).

More generally, let fCk(U,Rp), for kN. Then Dkf(a)Lk(Rn,Rp) satisfies
Dkf(a)(h1,,hk)=(Dh1Dhkf)(a)(a,hiRn,1ik).

Moreover, Dkf(a) is symmetric, that is, for a,hiRn where 1ik,
Dkf(a)(h1,h2,,hk)=Dkf(a)(hσ(1),hσ(2),,hσ(k)),

for every σSk, the permutation group on k elements, which consists of bijections of the set {1,2,,k}.

 

点赞 0

No Comments

Add your comment

韶华不为少年留。恨悠悠。几时休。