Let be I a non-empty and open interval of R.
A function f:I⟶R is said absolutely monotonic on I if :
- f is C∞ on I (differentiable as much as you want, continuous for all derivatives).
- ∀n∈N,∀x∈I,f(n)(x)≥0 where f(n) is the n-th derivative.
Let be a,b,α∈R, we call an homographic function, a function of this form :
f(x)=ax+bx−α
What would be a sufficient and necessary condition in order for f(x) to be absolutely monotonic?
Here is what I have attempted:
- f is C∞ by algebraic operations (quotient).
- I wanted to find a closed form of the n-th derivative of f.
I have thought of using Leibniz formula, obviously, it didn't work because the numerator becomes too complex to handle. - I remarked that the denominator is always positive due to being always squared when derivating again.
- Knowing that denominator is always positive, I eventually need to do is to consider when x<α and x>α, and prove that all derivatives' numerators have the same sign. So I can deduce the overall sign of the fraction. That's where I don't how to proceed further.
Answer
Let be a,b,γ∈R such that a<b and I=]a,b[ so that γ∉I.
Let α,β∈R such that:
∀x∈I,f(x)=αx+βx−γ, an homographic function.
First, for all n≥1, for all a∈C, for all x∈R∖{a} :
dndxn(1x−a)=(−1)nn!(x−a)n+1
Then, for all x∈I :
dndxnf(x)=αdndxn(xx−γ)+βdndxn(1x−γ)=αdn−1dxn−1((x−γ)−x(x−γ)2)+β(−1)nn!(x−γ)n+1=−αγdn−1dxn−1(1(x−γ)2)+β(−1)nn!(x−γ)n+1
By Leibniz's formula :
dn−1dxn−11(x−γ)2=n−1∑k=0(n−1k)(−1)kk!(x−γ)k+1(−1)n−k−1(n−k−1)!(x−γ)n−k=(−1)n−1(n−1)!n−1∑k=01(x−γ)n+1=(−1)n−1n!(x−γ)n+1
At the end :
dndxnf(x)=−αγdn−1dxn−1(1(x−γ)2)+β(−1)nn!(x−γ)n+1=αγ(−1)nn!(x−γ)n+1+β(−1)nn!(x−γ)n+1=(−1)nn!(x−γ)n+1(αγ+β)
Then f is absolutely monotonic if and only if for all n∈N, for all x∈I, f(n)(x)≥0.
Case n≥1
Sub-case : n is even
Let's write n=2k,k∈N∗.
Then, for all x∈I :
f(n)(x)=f(2k)(x)=(−1)2k(2k)!(αγ+β)(x−γ)2k+1=(2k)!(αγ+β)(x−γ)2k+1
Then, f(n)(x)≥0 if and only if (αγ+β)(x−γ)2k+1≥0.
- Either αγ+β≥0 and x−γ≥0 for all x∈I, i.e. x≥γ, i.e. a≥γ (1)
- Either αγ+β≤0 and x−γ≤0 for all x∈I, i.e. x≤γ, i.e. b≤γ (2)
Sub-case : n is odd
Let's write n=2k+1,k∈N.
Then, for all x∈I :
f(n)(x)=f(2k+1)(x)=(−1)2k+1(2k+1)!(αγ+β)(x−γ)2k+2=−(2k+1)!(αγ+β)((x−γ)k)2
Then −(αγ+β)≥0.
That is : αγ+β≤0.
Then, in the previous subcase, (1) is impossible, so that we only have (2).
Let's summarize so far.
In order for f to be absolutely monotonic, it is necessary (but not sufficient):
- αγ+β≤0
- b≤γ.
Case n=0
f(x)≥0 for all x∈I if and only if (αx+β)(x−γ)≥0.
That is:
- Either αx+β≥0 and x−γ≥0 (1)
- Either αx+β≤0 and x−γ≤0 (2)
(1) is impossible because x<γ due to the previous case.
Then we have (2), i.e. αx+β≤0 for all x∈I.
Then : αx≤−β.
- If α>0, then x≤−βα, i.e. b≤−βα, i.e. b≤min{−βα,γ}.
- If α<0, then x≥−βα, i.e. a≥−βα.
In the end:
If f is absolutely monotonic, necessarily, we have:
- αγ+β≤0.
- If α>0, I⊂]−∞,γ[ because γ≤−βα.
- If α<0, I⊂]−βα,γ[.
By construction, such an homographic function is always absolutely monotonic, so these conditions are sufficient.
No comments:
Post a Comment