
数学分析笔记——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:U→Rp. Then we have for the derivative Df:U→L(Rn,Rp)≃Rpn. If, in turn, Df is differentiable, then its derivative D2f:=D(Df), the second-order derivative of f, is a mapping U→L(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 T∈Lk(Rn,Rp) if and only if T:Rn×⋯×Rn→Rp 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))∋S↔T∈L2(Rn,Rp) if and only if S(h1)h2=T(h1,h2), for h1,h2∈Rn.
More generally, there exists a natural isomorphism of linear spaces
L(Rn,L(Rn,⋯,L(Rn,Rp)⋯))≃Lk(Rn,Rp)(k∈N∗∖{1}),
with S↔T if and only if (⋯((Sh1)h2)⋯)hk=T(h1,h2,⋯,hk), for h1,⋯,hk∈Rn.
Corollary. For every T∈Lk(Rn,Rp) there exists c>0 such that, for all h1,⋯,hk∈Rn,
‖T(h1,⋯,hk)‖≤c‖h1‖⋯‖hk‖.
Proposition. If T∈Lk(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)=∑1≤i≤kT(a1,⋯,ai−1,hi,ai+1,⋯,ak).
Definition. Let f:U→Rp, with U open in Rn. Then the notation f∈C0(U,Rp) means that f is continuous. By induction over k∈N∗ we say that f is a k times continuously differentiable mapping, notation f∈Ck(U,Rp), if f∈Ck−1(U,Rp) and if the derivative of order k−1
Dk−1f:U→L(Rn,Rp)
is a continuously differentiable mapping. We write f∈C∞(U,Rp) if f∈Ck(U,Rp), for all k∈N∗. If we want to consider f∈Ck for k∈N∗ or k=∞, we write f∈Ck with k∈N∗∞. In the case where p=1, we write Ck(U) instead of Ck(U,Rp).
Rephrasing the definition above, we obtain at once that f∈Ck(U,Rp) if f∈Ck−1(U,Rp) and if, for all i1,⋯,ik−1∈{1,⋯,n}, the partial derivative of order k−1
Dik−1⋯Di1f
belongs to C1(U,Rp). The latter condition is satisfied if all the partial derivatives of order k satisfy
DikDik−1⋯Di1f:=Dik(Dik−1⋯Di1f)∈C0(U,Rp).
Clearly, f∈Ck(U,Rp) if and only if
Df∈Ck−1(U,L(Rn,Rp)).
This can subsequently be used to prove, by induction over k, that the composition g∘f is a Ck mapping if f and g are Ck mappings. Indeed, we have D(g∘f)=((Dg)∘f)∘Df on account of the chain rule. Now, (Dg)∘f is a Ck−1 mapping, being a composition of the Ck mapping f with the Ck−1 mapping Dg, where we use the induction hypothesis. Furthermore, Df is a Ck−1 mapping, and composition of linear mappings is infinitely differentiable. Hence we obtain that D(g∘f) is a Ck−1 mapping.
Theorem. If U⊂Rn is open and f∈C2(U,Rp), then the bilinear mapping D2f(a)∈L2(Rn,Rp) satisfies
D2f(a)(h1,h2)=(Dh1Dh2f)(a)(a,h1,h2∈Rn).
Furthermore, D2f(a) is symmetric, that is,
D2f(a)(h1,h2)=D2f(a)(h2,h1)(a,h1,h2∈Rn).
More generally, let f∈Ck(U,Rp), for k∈N∗. Then Dkf(a)∈Lk(Rn,Rp) satisfies
Dkf(a)(h1,⋯,hk)=(Dh1⋯Dhkf)(a)(a,hi∈Rn,1≤i≤k).
Moreover, Dkf(a) is symmetric, that is, for a,hi∈Rn where 1≤i≤k,
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}.
No Comments