多个函数的线性组合的运算法则:
∀m,n∈N,m,n≥1,[∑i=1mcifi(x)](n)=∑i=1mcif(n)i(x)
证明
n=1
时显然成立。
设
n
时成立。则
[∑i=1mcifi(x)](n+1)={[∑i=1mcifi(x)](n)}′
=[∑i=1mcif(n)i(x)]′
=∑i=1mcif(n+1)i(x)
莱布尼茨公式
[f(x)⋅g(x)](n)=∑k=0nCknf(k)(x)g(n−k)(x)
证明
n=1
时显然成立。
设
n
时成立。则
[f(x)⋅g(x)](n+1)={[f(x)⋅g(x)](n)}′
=[∑k=0nCknf(k)(x)g(n−k)(x)]′
=∑k=0nCkn[f(k)(x)g(n−k)(x)]′
=∑k=0nCkn[f(k+1)(x)g(n−k)(x)+f(k)(x)g(n+1−k)(x)]
=∑k=0nCknf(k+1)(x)g(n−k)(x)+∑k=0nCknf(k)(x)g(n+1−k)(x)
=∑k=1n+1Ck−1nf(k)(x)g(n+1−k)(x)+∑k=0nCknf(k)(x)g(n+1−k)(x)
=f(n+1)(x)g(x)+∑k=1n(Ck−1n+Ckn)f(k)(x)g(n+1−k)(x)+f(x)g(n+1)(x)
=f(n+1)(x)g(x)+∑k=1nCkn+1f(k)(x)g(n+1−k)(x)+f(x)g(n+1)(x)
=∑k=0n+1Ckn+1f(k)(x)g(n+1−k)(x)